Zdenek Ryjácek

According to our database1, Zdenek Ryjácek authored at least 79 papers between 1990 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Closure for {K1, 4, K1, 4 + e}-free graphs.
J. Comb. Theory, Ser. B, 2019

2018
Hamiltonian properties of 3-connected {claw, hourglass}-free graphs.
Discrete Mathematics, 2018

2017
Characterisation of Graphs with Exclusive Sum Labelling.
Electronic Notes in Discrete Mathematics, 2017

Coloring the cliques of line graphs.
Discrete Mathematics, 2017

2016
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Discrete Mathematics, 2016

Rainbow cycles in edge-colored graphs.
Discrete Mathematics, 2016

Finite families of forbidden subgraphs for rainbow connection in graphs.
Discrete Mathematics, 2016

2015
Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs.
Graphs and Combinatorics, 2015

4-colorability of P6-free graphs.
Electronic Notes in Discrete Mathematics, 2015

2-factors with bounded number of components in claw-free graphs.
Discrete Mathematics, 2015

Preface.
Discrete Mathematics, 2015

Rainbow connection and forbidden subgraphs.
Discrete Mathematics, 2015

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2.
Discrete Mathematics, 2015

2014
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs.
Journal of Graph Theory, 2014

On 1-Hamilton-connected claw-free graphs.
Discrete Mathematics, 2014

2013
Stability of Hereditary Graph Classes Under Closure Operations.
Journal of Graph Theory, 2013

On Forbidden Pairs Implying Hamilton-Connectedness.
Journal of Graph Theory, 2013

Distance-locally disconnected graphs.
Discussiones Mathematicae Graph Theory, 2013

The rainbow connection number of 2-connected graphs.
Discrete Mathematics, 2013

2012
Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs.
SIAM J. Discrete Math., 2012

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs.
Journal of Graph Theory, 2012

How Many Conjectures Can You Stand? A Survey.
Graphs and Combinatorics, 2012

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs.
Discrete Mathematics, 2012

A Dirac theorem for trestles.
Discrete Mathematics, 2012

2011
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs.
Journal of Graph Theory, 2011

On stability of Hamilton-connectedness under the 2-closure in claw-free graphs.
Journal of Graph Theory, 2011

Hamiltonian index is NP-complete.
Discrete Applied Mathematics, 2011

2010
Closure concept for 2-factors in claw-free graphs.
Discrete Mathematics, 2010

On cycle lengths in claw-free graphs with complete closure.
Discrete Mathematics, 2010

Closure and forbidden pairs for 2-factors.
Discrete Mathematics, 2010

Preface.
Discrete Mathematics, 2010

2009
Disjoint Hamilton cycles in the star graph.
Inf. Process. Lett., 2009

2008
Neighborhood unions and extremal spanning trees.
Discrete Mathematics, 2008

Forbidden subgraphs that imply 2-factors.
Discrete Mathematics, 2008

Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks.
Discrete Mathematics, 2008

2007
Hamilton cycles in prisms.
Journal of Graph Theory, 2007

Short Disjoint Paths in Locally Connected Graphs.
Graphs and Combinatorics, 2007

Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.
Electronic Notes in Discrete Mathematics, 2007

2005
The Prism Over the Middle-levels Graph is Hamiltonian.
Order, 2005

On stability of the hamiltonian index under contractions and closures.
Journal of Graph Theory, 2005

Hourglasses and Hamilton cycles in 4-connected claw-free graphs.
Journal of Graph Theory, 2005

2004
On traceability and 2-factors in claw-free graphs.
Discussiones Mathematicae Graph Theory, 2004

Hamiltonian decompositions of prisms over cubic graphs.
Discrete Mathematics, 2004

Cycles through given vertices and closures.
Discrete Mathematics, 2004

2003
Contractibility techniques as a closure concept.
Journal of Graph Theory, 2003

On local and global independence numbers of a graph.
Discrete Applied Mathematics, 2003

Regular clique covers of graphs.
Australasian J. Combinatorics, 2003

2002
Closure and Forbidden Pairs for Hamiltonicity.
J. Comb. Theory, Ser. B, 2002

A note on degree conditions for hamiltonicity in 2-connected claw-free graphs.
Discrete Mathematics, 2002

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discrete Mathematics, 2002

A note on hamiltonicity of generalized net-free graphs of large diameter.
Discrete Mathematics, 2002

2001
On weights of induced paths and cycles in claw-free and K1, r-free graphs.
Journal of Graph Theory, 2001

On factors of 4-connected claw-free graphs.
Journal of Graph Theory, 2001

Claw-free graphs with complete closure.
Discrete Mathematics, 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.
Discrete Mathematics, 2001

Strengthening the closure concept in claw-free graphs.
Discrete Mathematics, 2001

2000
Closure and stable Hamiltonian properties in claw-free graphs.
Journal of Graph Theory, 2000

Closure Concepts: A Survey.
Graphs and Combinatorics, 2000

1999
Closure, 2-factors, and cycle coverings in claw-free graphs.
Journal of Graph Theory, 1999

Forbidden subgraphs, stability and hamiltonicity.
Discrete Mathematics, 1999

Forbidden subgraphs, hamiltonicity and closure in claw-free graphs.
Discrete Mathematics, 1999

Closure and Hamiltonian-connectivity of claw-free graphs.
Discrete Mathematics, 1999

Induced S(K1, 3) and hamiltonian cycles in the square of a graph.
Discrete Mathematics, 1999

1998
2-factors and hamiltonicity.
Discrete Mathematics, 1998

1997
On a Closure Concept in Claw-Free Graphs.
J. Comb. Theory, Ser. B, 1997

Factor-criticality and matching extension in DCT-graphs.
Discussiones Mathematicae Graph Theory, 1997

Matching extension in K1, r-free graphs with independent claw centers.
Discrete Mathematics, 1997

Claw-free graphs - A survey.
Discrete Mathematics, 1997

Dirac's minimum degree condition restricted to claws.
Discrete Mathematics, 1997

Local connectivity and cycle xtension in claw-free graphs.
Ars Comb., 1997

1996
Toughness and hamiltonicity in almost claw-free graphs.
Journal of Graph Theory, 1996

Hymn teorii grafów.
Discussiones Mathematicae Graph Theory, 1996

Shortest walks in almost claw-free graphs.
Ars Comb., 1996

1995
The flower conjecture in special classes of graphs.
Discussiones Mathematicae Graph Theory, 1995

On the independence number in K1, r+1-free graphs.
Discrete Mathematics, 1995

Hamiltonicity in claw-free graphs through induced bulls.
Discrete Mathematics, 1995

1994
Almost claw-free graphs.
Journal of Graph Theory, 1994

1993
N2-locally disconnected graphs.
Discrete Mathematics, 1993

1990
Hamiltonian circuits in N2-locally connected K1, 3-free graphs.
Journal of Graph Theory, 1990


  Loading...