László Lipták

Orcid: 0000-0003-2680-7964

According to our database1, László Lipták authored at least 59 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the <i>g</i>-extra connectivity of augmented cubes.
Theor. Comput. Sci., August, 2023

2022
Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs.
Int. J. Comput. Math. Comput. Syst. Theory, October, 2022

A Note on Linearly Many Faults of Interconnection Networks.
J. Interconnect. Networks, 2022

2021
Connectivity Properties of Generalized K4-Hypercubes.
J. Interconnect. Networks, 2021

Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract).
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Structure and Substructure Connectivity of Hypercube-Like Networks.
Parallel Process. Lett., 2020

2018
A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs.
Graphs Comb., 2018

2017
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions.
Parallel Process. Lett., 2017

On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs.
Graphs Comb., 2017

2015
Conditional Matching Preclusion For The Star Graphs.
Ars Comb., 2015

2014
Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs.
Int. J. Parallel Emergent Distributed Syst., 2014

Conditional Fault Hamiltonicity of the Star Graph.
Ars Comb., 2014

2013
Linearly many faults in dual-cube-like networks.
Theor. Comput. Sci., 2013

Conditional Matching preclusion for (n, k)-Star Graphs.
Parallel Process. Lett., 2013

Linearly many faults in augmented cubes.
Int. J. Parallel Emergent Distributed Syst., 2013

Linearly many faults in arrangement graphs.
Networks, 2013

4-ordered-Hamiltonian problems of the generalized Petersen graph <i>GP</i>(<i>n</i>, 4).
Math. Comput. Model., 2013

Diagnosability of Cayley graphs generated by transposition trees with missing edges.
Inf. Sci., 2013

Strong local diagnosability of (<i>n</i>, <i>k</i>)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges.
Inf. Process. Lett., 2013

Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees.
Graphs Comb., 2013

2012
Topological properties of folded hyper-star networks.
J. Supercomput., 2012

Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars.
Networks, 2012

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions.
Networks, 2012

A Unified Approach to the Conditional Diagnosability of Interconnection Networks.
J. Interconnect. Networks, 2012

On deriving conditional diagnosability of interconnection networks.
Inf. Process. Lett., 2012

Component connectivity of the hypercubes.
Int. J. Comput. Math., 2012

Solution to an open problem on 4-ordered Hamiltonian graphs.
Discret. Math., 2012

One-to-many node-disjoint paths of hyper-star networks.
Discret. Appl. Math., 2012

Matching preclusion and conditional matching preclusion for regular interconnection networks.
Discret. Appl. Math., 2012

Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products.
Discret. Appl. Math., 2012

2011
Optimal Independent Spanning Trees on Odd Graphs.
J. Supercomput., 2011

Conditional matching preclusion for the arrangement graphs.
Theor. Comput. Sci., 2011

Independent spanning trees on even networks.
Inf. Sci., 2011

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees.
Inf. Sci., 2011

Linearly Many Faults in (n, k)-Star Graphs.
Int. J. Found. Comput. Sci., 2011

A note on embeddings among folded hypercubes, even graphs and odd graphs.
Int. J. Comput. Math., 2011

Conditional matching preclusion for the alternating group graphs and split-stars.
Int. J. Comput. Math., 2011

On the edge-connectivity of graphs with two orbits of the same size.
Discret. Math., 2011

2010
Linearly many faults in 2-tree-generated networks.
Networks, 2010

4-Ordered Hamiltonicity for Some Chordal Ring Graphs.
J. Interconnect. Networks, 2010

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes.
J. Interconnect. Networks, 2010

Distance formula and shortest paths for the (n, k)-star graphs.
Inf. Sci., 2010

Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs.
Int. J. Comput. Math., 2010

2009
Conditional matching preclusion sets.
Inf. Sci., 2009

Embedding hypercubes, rings, and odd graphs into hyper-stars.
Int. J. Comput. Math., 2009

2008
Hamiltonian connectivity of 2-tree-generated networks.
Math. Comput. Model., 2008

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model.
J. Interconnect. Networks, 2008

Matching preclusion for Alternating Group Graphs and their Generalizations.
Int. J. Found. Comput. Sci., 2008

Strong structural properties of unidirectional star graphs.
Discret. Appl. Math., 2008

Orienting Cayley graphs generated by transposition trees.
Comput. Math. Appl., 2008

2007
Matching preclusion for some interconnection networks.
Networks, 2007

Linearly many faults in Cayley graphs generated by transposition trees.
Inf. Sci., 2007

Fault Resiliency of Cayley Graphs Generated by Transpositions.
Int. J. Found. Comput. Sci., 2007

2006
Structural Properties Of Hyper-Stars.
Ars Comb., 2006

2005
Lift-and-project ranks and antiblocker duality.
Oper. Res. Lett., 2005

2003
The stable set problem and the lift-and-project ranks of graphs.
Math. Program., 2003

2001
Critical Facets of the Stable Set Polytope.
Comb., 2001

2000
Facets with fixed defect of the stable set polytope.
Math. Program., 2000

1997
Sperner systems containing at most k sets of every cardinality.
Discret. Math., 1997


  Loading...