Kaiser, Tomáš; Vrána, Petr Quasigraphs and skeletal partitions. (English) Zbl 1498.05151 Eur. J. Comb. 107, Article ID 103563, 18 p. (2023). MSC: 05C45 05C76 05C40 PDFBibTeX XMLCite \textit{T. Kaiser} and \textit{P. Vrána}, Eur. J. Comb. 107, Article ID 103563, 18 p. (2023; Zbl 1498.05151) Full Text: DOI arXiv
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
Kaiser, Tomáš; Vrána, Petr The Hamiltonicity of essentially 9-connected line graphs. (English) Zbl 1521.05093 J. Graph Theory 97, No. 2, 241-259 (2021). MSC: 05C45 05C40 05C76 PDFBibTeX XMLCite \textit{T. Kaiser} and \textit{P. Vrána}, J. Graph Theory 97, No. 2, 241--259 (2021; Zbl 1521.05093) Full Text: DOI arXiv
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
Brousek, Jan; Holub, Přemysl; Ryjáček, Zdeněk; Vrána, Petr Finite families of forbidden subgraphs for rainbow connection in graphs. (English) Zbl 1338.05142 Discrete Math. 339, No. 9, 2304-2312 (2016). MSC: 05C40 05C15 PDFBibTeX XMLCite \textit{J. Brousek} et al., Discrete Math. 339, No. 9, 2304--2312 (2016; Zbl 1338.05142) Full Text: DOI
Holub, Přemysl; Ryjáček, Zdeněk; Schiermeyer, Ingo; Vrána, Petr Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. (English) Zbl 1327.05182 Discrete Math. 339, No. 2, 1058-1068 (2016). MSC: 05C40 05C15 05C60 PDFBibTeX XMLCite \textit{P. Holub} et al., Discrete Math. 339, No. 2, 1058--1068 (2016; Zbl 1327.05182) 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
Holub, Přemysl; Ryjáček, Zdeněk; Schiermeyer, Ingo; Vrána, Petr Rainbow connection and forbidden subgraphs. (English) Zbl 1315.05053 Discrete Math. 338, No. 10, 1706-1713 (2015). MSC: 05C15 05C60 05C35 PDFBibTeX XMLCite \textit{P. Holub} et al., Discrete Math. 338, No. 10, 1706--1713 (2015; Zbl 1315.05053) 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
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