Liu, Xia; Ryjáček, Zdeněk; Vrána, Petr; Xiong, Liming; Yang, Xiaojing Hamilton-connected {claw,net}-free graphs. II. (English) Zbl 1522.05266 J. Graph Theory 103, No. 1, 119-138 (2023). MSC: 05C45 PDFBibTeX XMLCite \textit{X. Liu} et al., J. Graph Theory 103, No. 1, 119--138 (2023; Zbl 1522.05266) Full Text: DOI
Liu, Xia; Ryjáček, Zdeněk; Vrána, Petr; Xiong, Liming; Yang, Xiaojing Hamilton-connected {claw, net}-free graphs. I. (English) Zbl 1522.05254 J. Graph Theory 102, No. 1, 154-179 (2023). MSC: 05C40 PDFBibTeX XMLCite \textit{X. Liu} et al., J. Graph Theory 102, No. 1, 154--179 (2023; Zbl 1522.05254) Full Text: DOI
Ryjáček, Zdeněk; Vrána, Petr Hamilton-connected {claw, bull}-free graphs. (English) Zbl 1522.05268 J. Graph Theory 102, No. 1, 128-153 (2023). MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{Z. Ryjáček} and \textit{P. Vrána}, J. Graph Theory 102, No. 1, 128--153 (2023; Zbl 1522.05268) Full Text: DOI
Holub, Přemysl; Ryjáček, Zdeněk; Vrána, Petr; Wang, Shipeng; Xiong, Liming Forbidden pairs of disconnected graphs for 2-factor of connected graphs. (English) Zbl 1522.05251 J. Graph Theory 100, No. 2, 209-231 (2022). MSC: 05C40 05C45 05C38 PDFBibTeX XMLCite \textit{P. Holub} et al., J. Graph Theory 100, No. 2, 209--231 (2022; Zbl 1522.05251) Full Text: DOI
Kaiser, Tomáš; Vrána, Petr Hamilton cycles in line graphs of 3-hypergraphs. (English) Zbl 1491.05119 Discrete Math. 345, No. 10, Article ID 113028, 4 p. (2022). Reviewer: Hang Lau (Montréal) MSC: 05C45 05C65 05C76 PDFBibTeX XMLCite \textit{T. Kaiser} and \textit{P. Vrána}, Discrete Math. 345, No. 10, Article ID 113028, 4 p. (2022; Zbl 1491.05119) Full Text: DOI arXiv
Vrána, Petr; Zhan, Xingzhi; Zhang, Leilei Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected. (English) Zbl 1490.05150 Discrete Math. 345, No. 8, Article ID 112909, 4 p. (2022). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C45 05C69 PDFBibTeX XMLCite \textit{P. Vrána} et al., Discrete Math. 345, No. 8, Article ID 112909, 4 p. (2022; Zbl 1490.05150) Full Text: DOI
Ryjáček, Zdeněk; Vrána, Petr Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected. (English) Zbl 1469.05100 Discrete Math. 344, No. 6, Article ID 112350, 16 p. (2021). Reviewer: Hang Lau (Montréal) MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{Z. Ryjáček} and \textit{P. Vrána}, Discrete Math. 344, No. 6, Article ID 112350, 16 p. (2021; Zbl 1469.05100) Full Text: DOI
Ryjáček, Zdeněk; Vrána, Petr; Xiong, Liming A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices. (English) Zbl 1439.05130 Graphs Comb. 36, No. 3, 665-677 (2020). MSC: 05C45 PDFBibTeX XMLCite \textit{Z. Ryjáček} et al., Graphs Comb. 36, No. 3, 665--677 (2020; Zbl 1439.05130) Full Text: DOI
Li, Binlong; Ozeki, Kenta; Ryjáček, Zdeněk; Vrána, Petr Thomassen’s conjecture for line graphs of 3-hypergraphs. (English) Zbl 1437.05127 Discrete Math. 343, No. 6, Article ID 111838, 18 p. (2020). MSC: 05C45 05C76 05C65 05C38 PDFBibTeX XMLCite \textit{B. Li} et al., Discrete Math. 343, No. 6, Article ID 111838, 18 p. (2020; Zbl 1437.05127) Full Text: DOI
Ryjáček, Zdeněk; Vrána, Petr; Wang, Shipeng Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs. (English) Zbl 1402.05130 J. Comb. Theory, Ser. B 134, 239-263 (2019). MSC: 05C45 PDFBibTeX XMLCite \textit{Z. Ryjáček} et al., J. Comb. Theory, Ser. B 134, 239--263 (2019; Zbl 1402.05130) Full Text: DOI
Ryjáček, Zdeněk; Vrána, Petr; Xiong, Liming Hamiltonian properties of 3-connected {claw,hourglass}-free graphs. (English) Zbl 1384.05105 Discrete Math. 341, No. 6, 1806-1815 (2018). MSC: 05C45 05C40 05C76 PDFBibTeX XMLCite \textit{Z. Ryjáček} et al., Discrete Math. 341, No. 6, 1806--1815 (2018; Zbl 1384.05105) Full Text: DOI
Čada, Roman; Chiba, Shuya; Ozeki, Kenta; Vrána, Petr; Yoshimoto, Kiyoshi Equivalence of Jackson’s and Thomassen’s conjectures. (English) Zbl 1315.05119 J. Comb. Theory, Ser. B 114, 124-147 (2015). MSC: 05C76 05C38 05C45 PDFBibTeX XMLCite \textit{R. Čada} et al., J. Comb. Theory, Ser. B 114, 124--147 (2015; Zbl 1315.05119) Full Text: DOI
Ryjáček, Zdeněk; Vrána, Petr A closure for 1-Hamilton-connectedness in claw-free graphs. (English) Zbl 1292.05160 J. Graph Theory 75, No. 4, 358-376 (2014). MSC: 05C40 05C76 PDFBibTeX XMLCite \textit{Z. Ryjáček} and \textit{P. Vrána}, J. Graph Theory 75, No. 4, 358--376 (2014; Zbl 1292.05160) Full Text: DOI
Kaiser, Tomáš; Ryjáček, Zdeněk; Vrána, Petr On 1-Hamilton-connected claw-free graphs. (English) Zbl 1281.05085 Discrete Math. 321, 1-11 (2014). MSC: 05C40 05C76 PDFBibTeX XMLCite \textit{T. Kaiser} et al., Discrete Math. 321, 1--11 (2014; Zbl 1281.05085) Full Text: DOI
Faudree, Jill R.; Faudree, Ralph J.; Ryjáček, Zdeněk; Vrána, Petr On forbidden pairs implying Hamilton-connectedness. (English) Zbl 1261.05052 J. Graph Theory 72, No. 3-4, 327-345 (2013). MSC: 05C40 05C60 05C45 PDFBibTeX XMLCite \textit{J. R. Faudree} et al., J. Graph Theory 72, No. 3--4, 327--345 (2013; Zbl 1261.05052) Full Text: DOI
Kužel, Roman; Ryjáček, Zdeněk; Teska, Jakub; Vrána, Petr Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. (English) Zbl 1244.05130 Discrete Math. 312, No. 14, 2177-2189 (2012). MSC: 05C38 05C40 05C69 PDFBibTeX XMLCite \textit{R. Kužel} et al., Discrete Math. 312, No. 14, 2177--2189 (2012; Zbl 1244.05130) Full Text: DOI
Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr Thomassen’s conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. (English) Zbl 1242.05157 J. Graph Theory 69, No. 3-4, 241-250 (2012). MSC: 05C45 05C40 05C10 05C38 PDFBibTeX XMLCite \textit{R. Kužel} et al., J. Graph Theory 69, No. 3--4, 241--250 (2012; Zbl 1242.05157) Full Text: DOI
Kaiser, Tomáš; Vrána, Petr Hamilton cycles in 5-connected line graphs. (English) Zbl 1239.05113 Eur. J. Comb. 33, No. 5, 924-947 (2012). MSC: 05C45 05C38 05C40 PDFBibTeX XMLCite \textit{T. Kaiser} and \textit{P. Vrána}, Eur. J. Comb. 33, No. 5, 924--947 (2012; Zbl 1239.05113) Full Text: DOI arXiv
Broersma, H. J.; Ryjáček, Z.; Vrána, P. How many conjectures can you stand? A survey. (English) Zbl 1234.05146 Graphs Comb. 28, No. 1, 57-75 (2012). MSC: 05C45 05C38 05C35 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Graphs Comb. 28, No. 1, 57--75 (2012; Zbl 1234.05146) Full Text: DOI Link
Kaiser, Tomáš; Vrána, Petr Hamilton cycles in 6-connected claw-free graphs (extended abstract). (English) Zbl 1273.05130 Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 319-322 (2009). MSC: 05C45 05C38 05C40 PDFBibTeX XMLCite \textit{T. Kaiser} and \textit{P. Vrána}, Electron. Notes Discrete Math. 34, 319--322 (2009; Zbl 1273.05130) Full Text: DOI
Broersma, Hajo; Fijavž, Gašper; Kaiser, Tomáš; Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. (English) Zbl 1157.05041 Discrete Math. 308, No. 24, 6064-6077 (2008). MSC: 05C69 05C38 PDFBibTeX XMLCite \textit{H. Broersma} et al., Discrete Math. 308, No. 24, 6064--6077 (2008; Zbl 1157.05041) Full Text: DOI Link
Broersma, Hajo; Fijavž, Gašper; Kaiser, Tomáš; Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. (English) Zbl 1291.05114 Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 55-59 (2007). MSC: 05C45 05C76 PDFBibTeX XMLCite \textit{H. Broersma} et al., Electron. Notes Discrete Math. 28, 55--59 (2007; Zbl 1291.05114) Full Text: DOI Link