Zdenek Ryjácek

Orcid: 0000-0002-9877-0825

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

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



In proceedings 
PhD thesis 


On csauthors.net:


Hamilton-connected {claw,net}-free graphs, II.
J. Graph Theory, May, 2023

Hamilton-connected {claw, bull}-free graphs.
J. Graph Theory, 2023

Hamilton-connected {claw, net}-free graphs, I.
J. Graph Theory, 2023

Forbidden pairs of disconnected graphs for 2-factor of connected graphs.
J. Graph Theory, 2022

On Exclusive Sum Labellings of Hypergraphs.
Graphs Comb., 2022

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.
Discret. Math., 2022

Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected.
Discret. Math., 2021

A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices.
Graphs Comb., 2020

Thomassen's conjecture for line graphs of 3-hypergraphs.
Discret. Math., 2020

Closure for {<i>K</i><sub>1, 4</sub>, <i>K</i><sub>1, 4</sub> + <i>e</i>}-free graphs.
J. Comb. Theory B, 2019

On forbidden induced subgraphs for K1, 3-free perfect graphs.
Discret. Math., 2019

Hamiltonian properties of 3-connected {claw, hourglass}-free graphs.
Discret. Math., 2018

Characterisation of Graphs with Exclusive Sum Labelling.
Electron. Notes Discret. Math., 2017

Coloring the cliques of line graphs.
Discret. Math., 2017

Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Discret. Math., 2016

Rainbow cycles in edge-colored graphs.
Discret. Math., 2016

Finite families of forbidden subgraphs for rainbow connection in graphs.
Discret. Math., 2016

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

4-colorability of P<sub>6</sub>-free graphs.
Electron. Notes Discret. Math., 2015

2-factors with bounded number of components in claw-free graphs.
Discret. Math., 2015

Discret. Math., 2015

Rainbow connection and forbidden subgraphs.
Discret. Math., 2015

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2.
Discret. Math., 2015

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

On 1-Hamilton-connected claw-free graphs.
Discret. Math., 2014

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

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

Distance-locally disconnected graphs.
Discuss. Math. Graph Theory, 2013

The rainbow connection number of 2-connected graphs.
Discret. Math., 2013

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

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

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

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

A Dirac theorem for trestles.
Discret. Math., 2012

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

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

Hamiltonian index is NP-complete.
Discret. Appl. Math., 2011

Closure concept for 2-factors in claw-free graphs.
Discret. Math., 2010

On cycle lengths in claw-free graphs with complete closure.
Discret. Math., 2010

Closure and forbidden pairs for 2-factors.
Discret. Math., 2010

Discret. Math., 2010

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

Neighborhood unions and extremal spanning trees.
Discret. Math., 2008

Forbidden subgraphs that imply 2-factors.
Discret. Math., 2008

Hamilton cycles in prisms.
J. Graph Theory, 2007

Short Disjoint Paths in Locally Connected Graphs.
Graphs Comb., 2007

Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.
Electron. Notes Discret. Math., 2007

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

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

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

On traceability and 2-factors in claw-free graphs.
Discuss. Math. Graph Theory, 2004

Hamiltonian decompositions of prisms over cubic graphs.
Discret. Math., 2004

Cycles through given vertices and closures.
Discret. Math., 2004

Contractibility techniques as a closure concept.
J. Graph Theory, 2003

On local and global independence numbers of a graph.
Discret. Appl. Math., 2003

Regular clique covers of graphs.
Australas. J Comb., 2003

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

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

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discret. Math., 2002

A note on hamiltonicity of generalized net-free graphs of large diameter.
Discret. Math., 2002

On weights of induced paths and cycles in claw-free and <i>K</i><sub>1</sub><sub><i>, r</i></sub>-free graphs.
J. Graph Theory, 2001

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

Claw-free graphs with complete closure.
Discret. Math., 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.
Discret. Math., 2001

Strengthening the closure concept in claw-free graphs.
Discret. Math., 2001

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

Closure Concepts: A Survey.
Graphs Comb., 2000

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

Forbidden subgraphs, stability and hamiltonicity.
Discret. Math., 1999

Forbidden subgraphs, hamiltonicity and closure in claw-free graphs.
Discret. Math., 1999

Closure and Hamiltonian-connectivity of claw-free graphs.
Discret. Math., 1999

Induced S(K<sub>1, 3</sub>) and hamiltonian cycles in the square of a graph.
Discret. Math., 1999

2-factors and hamiltonicity.
Discret. Math., 1998

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

Factor-criticality and matching extension in DCT-graphs.
Discuss. Math. Graph Theory, 1997

Matching extension in K<sub>1, r</sub>-free graphs with independent claw centers.
Discret. Math., 1997

Claw-free graphs - A survey.
Discret. Math., 1997

Dirac's minimum degree condition restricted to claws.
Discret. Math., 1997

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

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

Hymn teorii grafów.
Discuss. Math. Graph Theory, 1996

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

The flower conjecture in special classes of graphs.
Discuss. Math. Graph Theory, 1995

On the independence number in K<sub>1, r+1</sub>-free graphs.
Discret. Math., 1995

Hamiltonicity in claw-free graphs through induced bulls.
Discret. Math., 1995

Almost claw-free graphs.
J. Graph Theory, 1994

N<sub>2</sub>-locally disconnected graphs.
Discret. Math., 1993

Hamiltonian circuits in <i>N</i><sub>2</sub>-locally connected <i>K</i><sub>1, 3</sub>-free graphs.
J. Graph Theory, 1990