Hamiltonian circuits in N2-locally connected K1, 3-free graphs. - Zdenek Ryjácek (J. Graph Theory, 1990)

N2-locally disconnected graphs. - Zdenek Ryjácek (Discret. Math., 1993)

Almost claw-free graphs. - Zdenek Ryjácek (J. Graph Theory, 1994)

Hamiltonicity in claw-free graphs through induced bulls. - Zdenek Ryjácek (Discret. Math., 1995)

On the independence number in K1, r+1-free graphs. - Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1995)

The flower conjecture in special classes of graphs. - Zdenek Ryjácek; Ingo Schiermeyer (Discuss. Math. Graph Theory, 1995)

Shortest walks in almost claw-free graphs. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Zdenek Ryjácek (Ars Comb., 1996)

Hymn teorii grafów. - Mariusz Meszka; Joanna Nowak; Zdenek Ryjácek; Bohdan Zelinka (Discuss. Math. Graph Theory, 1996)

Toughness and hamiltonicity in almost claw-free graphs. - Haitze J. Broersma; Zdenek Ryjácek; Ingo Schiermeyer (J. Graph Theory, 1996)

Local connectivity and cycle xtension in claw-free graphs. - Ralph J. Faudree; Zdenek Ryjácek; Ingo Schiermeyer (Ars Comb., 1997)

Dirac's minimum degree condition restricted to claws. - Haitze J. Broersma; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1997)

Claw-free graphs - A survey. - Ralph J. Faudree; Evelyne Flandrin; Zdenek Ryjácek (Discret. Math., 1997)

Matching extension in K1, r-free graphs with independent claw centers. - Zdenek Ryjácek (Discret. Math., 1997)

Factor-criticality and matching extension in DCT-graphs. - Odile Favaron; Zdenek Ryjácek (Discuss. Math. Graph Theory, 1997)

On a Closure Concept in Claw-Free Graphs. - Zdenek Ryjácek (J. Comb. Theory B, 1997)

2-factors and hamiltonicity. - Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1998)

Induced S(K1, 3) and hamiltonian cycles in the square of a graph. - Mohamed El Kadi Abderrezzak; Evelyne Flandrin; Zdenek Ryjácek (Discret. Math., 1999)

Closure and Hamiltonian-connectivity of claw-free graphs. - Béla Bollobás; Oliver Riordan; Zdenek Ryjácek; Akira Saito; Richard H. Schelp (Discret. Math., 1999)

Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. - Jan Brousek; Zdenek Ryjácek; Odile Favaron (Discret. Math., 1999)

Forbidden subgraphs, stability and hamiltonicity. - Jan Brousek; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1999)

Closure, 2-factors, and cycle coverings in claw-free graphs. - Zdenek Ryjácek; Akira Saito; Richard H. Schelp (J. Graph Theory, 1999)

Closure Concepts: A Survey. - Hajo Broersma; Zdenek Ryjácek; Ingo Schiermeyer (Graphs Comb., 2000)

Closure and stable Hamiltonian properties in claw-free graphs. - Stephan Brandt; Odile Favaron; Zdenek Ryjácek (J. Graph Theory, 2000)

Strengthening the closure concept in claw-free graphs. - Hajo Broersma; Zdenek Ryjácek (Discret. Math., 2001)

Clique covering and degree conditions for hamiltonicity in claw-free graphs. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Zdenek Ryjácek (Discret. Math., 2001)

Claw-free graphs with complete closure. - Zdenek Ryjácek; Akira Saito; Richard H. Schelp (Discret. Math., 2001)

On factors of 4-connected claw-free graphs. - Haitze J. Broersma; Matthias Kriesell; Zdenek Ryjácek (J. Graph Theory, 2001)

On weights of induced paths and cycles in claw-free and K1, r-free graphs. - Jochen Harant; Margit Voigt; Stanislav Jendrol'; Bert Randerath; Zdenek Ryjácek; Ingo Schiermeyer (J. Graph Theory, 2001)

A note on hamiltonicity of generalized net-free graphs of large diameter. - Jan Brousek; Ralph J. Faudree; Zdenek Ryjácek (Discret. Math., 2002)

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. - Jochen Harant; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2002)

A note on degree conditions for hamiltonicity in 2-connected claw-free graphs. - Ondrej Kovárík; Milos Mulac; Zdenek Ryjácek (Discret. Math., 2002)

Closure and Forbidden Pairs for Hamiltonicity. - Zdenek Ryjácek (J. Comb. Theory B, 2002)

Regular clique covers of graphs. - Dan Archdeacon; Dalibor Froncek; Robert Jajcay; Zdenek Ryjácek; Jozef Sirán (Australas. J Comb., 2003)

On local and global independence numbers of a graph. - Ralph J. Faudree; Zdenek Ryjácek; Richard H. Schelp (Discret. Appl. Math., 2003)

Contractibility techniques as a closure concept. - Zdenek Ryjácek; Richard H. Schelp (J. Graph Theory, 2003)

Cycles through given vertices and closures. - Roman Cada; Evelyne Flandrin; Hao Li 002; Zdenek Ryjácek (Discret. Math., 2004)

Hamiltonian decompositions of prisms over cubic graphs. - Roman Cada; Tomás Kaiser; Moshe Rosenfeld 001; Zdenek Ryjácek (Discret. Math., 2004)

On traceability and 2-factors in claw-free graphs. - Dalibor Froncek; Zdenek Ryjácek; Zdzislaw Skupien (Discuss. Math. Graph Theory, 2004)

Hourglasses and Hamilton cycles in 4-connected claw-free graphs. - Tomás Kaiser; Mingchu Li; Zdenek Ryjácek; Liming Xiong (J. Graph Theory, 2005)

On stability of the hamiltonian index under contractions and closures. - Liming Xiong; Zdenek Ryjácek; Hajo Broersma (J. Graph Theory, 2005)

The Prism Over the Middle-levels Graph is Hamiltonian. - Peter Horák; Tomás Kaiser; Moshe Rosenfeld 001; Zdenek Ryjácek (Order, 2005)

Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. - Hajo Broersma; Gasper Fijavz; Tomás Kaiser; Roman Kuzel; Zdenek Ryjácek; Petr Vrána (Electron. Notes Discret. Math., 2007)

Short Disjoint Paths in Locally Connected Graphs. - Chuanping Chen; Roman Cada; Tomás Kaiser; Zdenek Ryjácek (Graphs Comb., 2007)

Hamilton cycles in prisms. - Tomás Kaiser; Zdenek Ryjácek; Daniel Král; Moshe Rosenfeld 001; Heinz-Jürgen Voss (J. Graph Theory, 2007)

Forbidden subgraphs that imply 2-factors. - Jill R. Faudree; Ralph J. Faudree; Zdenek Ryjácek (Discret. Math., 2008)

Neighborhood unions and extremal spanning trees. - Evelyne Flandrin; Tomás Kaiser; Roman Kuzel; Hao Li 002; Zdenek Ryjácek (Discret. Math., 2008)

Disjoint Hamilton cycles in the star graph. - Roman Cada; Tomás Kaiser; Moshe Rosenfeld 001; Zdenek Ryjácek (Inf. Process. Lett., 2009)

Preface. - Jan Kratochvíl; Jaroslav Nesetril; Zdenek Ryjácek (Discret. Math., 2010)

Closure and forbidden pairs for 2-factors. - Zdenek Ryjácek; Khikmat Saburov (Discret. Math., 2010)

On cycle lengths in claw-free graphs with complete closure. - Zdenek Ryjácek; Zdzislaw Skupien; Petr Vrána (Discret. Math., 2010)

Closure concept for 2-factors in claw-free graphs. - Zdenek Ryjácek; Liming Xiong; Kiyoshi Yoshimoto (Discret. Math., 2010)

Hamiltonian index is NP-complete. - Zdenek Ryjácek; Gerhard J. Woeginger; Liming Xiong (Discret. Appl. Math., 2011)

On stability of Hamilton-connectedness under the 2-closure in claw-free graphs. - Zdenek Ryjácek; Petr Vrána (J. Graph Theory, 2011)

Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs. - Zdenek Ryjácek; Petr Vrána (J. Graph Theory, 2011)

A Dirac theorem for trestles. - Stanislav Jendrol'; Tomás Kaiser; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2012)

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. - Roman Kuzel; Zdenek Ryjácek; Jakub Teska; Petr Vrána (Discret. Math., 2012)

How Many Conjectures Can You Stand? A Survey. - Haitze J. Broersma; Zdenek Ryjácek; Petr Vrána (Graphs Comb., 2012)

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. - Roman Kuzel; Zdenek Ryjácek; Petr Vrána (J. Graph Theory, 2012)

Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs. - Binlong Li; Zdenek Ryjácek; Ying Wang; Shenggui Zhang (SIAM J. Discret. Math., 2012)

The rainbow connection number of 2-connected graphs. - Jan Ekstein; Premysl Holub; Tomás Kaiser; Maria Koch; Stephan Matos Camacho; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2013)

Distance-locally disconnected graphs. - Mirka Miller; Joe Ryan 001; Zdenek Ryjácek (Discuss. Math. Graph Theory, 2013)

On Forbidden Pairs Implying Hamilton-Connectedness. - Jill R. Faudree; Ralph J. Faudree; Zdenek Ryjácek; Petr Vrána (J. Graph Theory, 2013)

Stability of Hereditary Graph Classes Under Closure Operations. - Mirka Miller; Joe Ryan 001; Zdenek Ryjácek; Jakub Teska; Petr Vrána (J. Graph Theory, 2013)

On 1-Hamilton-connected claw-free graphs. - Tomás Kaiser; Zdenek Ryjácek; Petr Vrána (Discret. Math., 2014)

A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs. - Zdenek Ryjácek; Petr Vrána (J. Graph Theory, 2014)

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2015)

Rainbow connection and forbidden subgraphs. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2015)

Preface. - Mirko Hornák; Zdenek Ryjácek; Martin Skoviera (Discret. Math., 2015)

2-factors with bounded number of components in claw-free graphs. - Kenta Ozeki; Zdenek Ryjácek; Kiyoshi Yoshimoto (Discret. Math., 2015)

4-colorability of P6-free graphs. - Christoph Brause; Ingo Schiermeyer; Premysl Holub; Zdenek Ryjácek; Petr Vrána; Rastislav Krivos-Bellus (Electron. Notes Discret. Math., 2015)

Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs. - Zdenek Ryjácek; Liming Xiong; Jun Yin (Graphs Comb., 2015)

Finite families of forbidden subgraphs for rainbow connection in graphs. - Jan Brousek; Premysl Holub; Zdenek Ryjácek; Petr Vrána (Discret. Math., 2016)

Rainbow cycles in edge-colored graphs. - Roman Cada; Atsushi Kaneko; Zdenek Ryjácek; Kiyoshi Yoshimoto (Discret. Math., 2016)

Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2016)

Coloring the cliques of line graphs. - Gábor Bacsó; Zdenek Ryjácek; Zsolt Tuza (Discret. Math., 2017)

Characterisation of Graphs with Exclusive Sum Labelling. - Mirka Miller; Joseph F. Ryan 001; Zdenek Ryjácek (Electron. Notes Discret. Math., 2017)

Hamiltonian properties of 3-connected {claw, hourglass}-free graphs. - Zdenek Ryjácek; Petr Vrána; Liming Xiong (Discret. Math., 2018)

On forbidden induced subgraphs for K1, 3-free perfect graphs. - Christoph Brause; Premysl Holub; Adam Kabela; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2019)

Closure for {K1, 4, K1, 4 + e}-free graphs. - Zdenek Ryjácek; Petr Vrána; Shipeng Wang (J. Comb. Theory B, 2019)

Thomassen's conjecture for line graphs of 3-hypergraphs. - Binlong Li; Kenta Ozeki; Zdenek Ryjácek; Petr Vrána (Discret. Math., 2020)

A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices. - Zdenek Ryjácek; Petr Vrána; Liming Xiong (Graphs Comb., 2020)

Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected. - Zdenek Ryjácek; Petr Vrána (Discret. Math., 2021)

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. - Christoph Brause; Trung Duy Doan; Premysl Holub; Adam Kabela; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2022)

On Exclusive Sum Labellings of Hypergraphs. - Christopher Purcell; Joe Ryan 001; Zdenek Ryjácek; Mária Skyvová (Graphs Comb., 2022)

Forbidden pairs of disconnected graphs for 2-factor of connected graphs. - Premysl Holub; Zdenek Ryjácek; Petr Vrána; Shipeng Wang; Liming Xiong (J. Graph Theory, 2022)

Hamilton-connected {claw, net}-free graphs, I. - Xia Liu; Zdenek Ryjácek; Petr Vrána; Liming Xiong; Xiaojing Yang (J. Graph Theory, 2023)

Hamilton-connected {claw, bull}-free graphs. - Zdenek Ryjácek; Petr Vrána (J. Graph Theory, 2023)

Hamilton-connected {claw,net}-free graphs, II. - Xia Liu; Zdenek Ryjácek; Petr Vrána; Liming Xiong; Xiaojing Yang (J. Graph Theory, 2023)

A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs. - Adam Kabela; Zdenek Ryjácek; Mária Skyvová; Petr Vrána (Discret. Math., 2024)

Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected. - Adam Kabela; Zdenek Ryjácek; Mária Skyvová; Petr Vrána (Discret. Math., 2025)