Petr Vrána

42 papers Journal 42
YearRankTypeTitle / Venue / Authors
2026 J jnl
Every 4-connected {claw, hourglass}-free graph is 2-Hamiltonian.
Discret. Math.
Zdenek Ryjácek, Petr Vrána
2025 J jnl
Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected.
Discret. Math.
Adam Kabela, Zdenek Ryjácek, Mária Skyvová, Petr Vrána
2024 J jnl
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs.
Discret. Math.
Adam Kabela, Zdenek Ryjácek, Mária Skyvová, Petr Vrána
2023 J jnl
Hamilton-connected {claw, bull}-free graphs.
J. Graph Theory
Zdenek Ryjácek, Petr Vrána
2023 J jnl
Hamilton-connected {claw, net}-free graphs, I.
J. Graph Theory
Xia Liu, Zdenek Ryjácek, Petr Vrána, Liming Xiong, Xiaojing Yang
2023 J jnl
Hamilton-connected {claw,net}-free graphs, II.
J. Graph Theory
Xia Liu, Zdenek Ryjácek, Petr Vrána, Liming Xiong, Xiaojing Yang
2023 J jnl
Quasigraphs and skeletal partitions.
Eur. J. Comb.
Tomás Kaiser, Petr Vrána
2022 J jnl
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected.
Discret. Math.
Petr Vrána, Xingzhi Zhan, Leilei Zhang
2022 J jnl
Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs.
Electron. J. Comb.
Maria Chudnovsky, Adam Kabela, Binlong Li, Petr Vrána
2022 J jnl
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.
Discret. Math.
Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2022 J jnl
Forbidden pairs of disconnected graphs for 2-factor of connected graphs.
J. Graph Theory
Premysl Holub, Zdenek Ryjácek, Petr Vrána, Shipeng Wang, Liming Xiong
2022 J jnl
Hamilton cycles in line graphs of 3-hypergraphs.
Discret. Math.
Tomás Kaiser, Petr Vrána
2021 J jnl
Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected.
Discret. Math.
Zdenek Ryjácek, Petr Vrána
2021 J jnl
The Hamiltonicity of essentially 9-connected line graphs.
J. Graph Theory
Tomás Kaiser, Petr Vrána
2020 J jnl
A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices.
Graphs Comb.
Zdenek Ryjácek, Petr Vrána, Liming Xiong
2020 J jnl
Thomassen's conjecture for line graphs of 3-hypergraphs.
Discret. Math.
Binlong Li, Kenta Ozeki, Zdenek Ryjácek, Petr Vrána
2019 J jnl
Closure for {
J. Comb. Theory B
Zdenek Ryjácek, Petr Vrána, Shipeng Wang
2019 J jnl
On forbidden induced subgraphs for K1, 3-free perfect graphs.
Discret. Math.
Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2018 J jnl
Hamiltonian properties of 3-connected {claw, hourglass}-free graphs.
Discret. Math.
Zdenek Ryjácek, Petr Vrána, Liming Xiong
2017 J jnl
Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity.
J. Graph Theory
Binlong Li, Petr Vrána
2016 J jnl
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Discret. Math.
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2016 J jnl
Finite families of forbidden subgraphs for rainbow connection in graphs.
Discret. Math.
Jan Brousek, Premysl Holub, Zdenek Ryjácek, Petr Vrána
2015 J jnl
4-colorability of P
Electron. Notes Discret. Math.
Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus
2015 J jnl
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discret. Math.
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2015 J jnl
Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory B
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2015 J jnl
Rainbow connection and forbidden subgraphs.
Discret. Math.
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2014 J jnl
2-edge-Hamiltonian-connectedness of 4-connected plane graphs.
Eur. J. Comb.
Kenta Ozeki, Petr Vrána
2014 J jnl
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs.
J. Graph Theory
Zdenek Ryjácek, Petr Vrána
2014 J jnl
On 1-Hamilton-connected claw-free graphs.
Discret. Math.
Tomás Kaiser, Zdenek Ryjácek, Petr Vrána
2013 J jnl
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discret. Math.
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2013 J jnl
On Forbidden Pairs Implying Hamilton-Connectedness.
J. Graph Theory
Jill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek, Petr Vrána
2013 J jnl
Stability of Hereditary Graph Classes Under Closure Operations.
J. Graph Theory
Mirka Miller, Joe Ryan, Zdenek Ryjácek, Jakub Teska, Petr Vrána
2012 J jnl
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs.
Discret. Math.
Roman Kuzel, Zdenek Ryjácek, Jakub Teska, Petr Vrána
2012 J jnl
Hamilton cycles in 5-connected line graphs.
Eur. J. Comb.
Tomás Kaiser, Petr Vrána
2012 J jnl
How Many Conjectures Can You Stand? A Survey.
Graphs Comb.
Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána
2012 J jnl
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs.
J. Graph Theory
Roman Kuzel, Zdenek Ryjácek, Petr Vrána
2011 J jnl
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs.
J. Graph Theory
Zdenek Ryjácek, Petr Vrána
2011 J jnl
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs.
J. Graph Theory
Zdenek Ryjácek, Petr Vrána
2010 J jnl
On cycle lengths in claw-free graphs with complete closure.
Discret. Math.
Zdenek Ryjácek, Zdzislaw Skupien, Petr Vrána
2009 J jnl
Hamilton cycles in 6-connected claw-free graphs (Extended abstract).
Electron. Notes Discret. Math.
Tomás Kaiser, Petr Vrána
2008 J jnl
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks.
Discret. Math.
Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána
2007 J jnl
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.
Electron. Notes Discret. Math.
Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána