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)

Hamilton cycles in 6-connected claw-free graphs (Extended abstract). - Tomás Kaiser; Petr Vrána (Electron. Notes Discret. Math., 2009)

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

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)

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)

Hamilton cycles in 5-connected line graphs. - Tomás Kaiser; Petr Vrána (Eur. J. Comb., 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)

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)

4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2013)

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

2-edge-Hamiltonian-connectedness of 4-connected plane graphs. - Kenta Ozeki; Petr Vrána (Eur. J. Comb., 2014)

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

Rainbow connection and forbidden subgraphs. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (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)

Equivalence of Jackson's and Thomassen's conjectures. - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (J. Comb. Theory B, 2015)

A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2015)

Finite families of forbidden subgraphs for rainbow connection in graphs. - Jan Brousek; Premysl Holub; Zdenek Ryjácek; Petr Vrána (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)

Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity. - Binlong Li; Petr Vrána (J. Graph Theory, 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)

The Hamiltonicity of essentially 9-connected line graphs. - Tomás Kaiser; Petr Vrána (J. Graph Theory, 2021)

Forbidden Induced Pairs for Perfectness and $ omega$-Colourability of Graphs. - Maria Chudnovsky; Adam Kabela; Binlong Li; Petr Vrána (Electron. J. Comb., 2022)

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)

Hamilton cycles in line graphs of 3-hypergraphs. - Tomás Kaiser; Petr Vrána (Discret. Math., 2022)

Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. - Petr Vrána; Xingzhi Zhan; Leilei Zhang (Discret. Math., 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)

Quasigraphs and skeletal partitions. - Tomás Kaiser; Petr Vrána (Eur. J. Comb., 2023)

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)