Ahn, Jungho; Jaffke, Lars; Kwon, O-joung; Lima, Paloma T. Well-partitioned chordal graphs. (English) Zbl 07541590 Discrete Math. 345, No. 10, Article ID 112985, 23 p. (2022). MSC: 05C70 05C40 68Q17 PDF BibTeX XML Cite \textit{J. Ahn} et al., Discrete Math. 345, No. 10, Article ID 112985, 23 p. (2022; Zbl 07541590) Full Text: DOI OpenURL
Wiener, Gábor; Yokota, Maho; Zamfirescu, Carol T. Spiders everywhere. (English) Zbl 1454.05068 Discrete Appl. Math. 289, 516-522 (2021). MSC: 05C45 05C05 PDF BibTeX XML Cite \textit{G. Wiener} et al., Discrete Appl. Math. 289, 516--522 (2021; Zbl 1454.05068) Full Text: DOI OpenURL
Cerioli, Márcia R.; Lima, Paloma T. Intersection of longest paths in graph classes. (English) Zbl 1440.05075 Discrete Appl. Math. 281, 96-105 (2020). MSC: 05C12 05C38 PDF BibTeX XML Cite \textit{M. R. Cerioli} and \textit{P. T. Lima}, Discrete Appl. Math. 281, 96--105 (2020; Zbl 1440.05075) Full Text: DOI OpenURL
Cerioli, Márcia R.; Fernandes, Cristina G.; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma T. Transversals of longest paths. (English) Zbl 1431.05051 Discrete Math. 343, No. 3, Article ID 111717, 10 p. (2020). MSC: 05C12 05C38 05D15 05C10 05C05 05C35 PDF BibTeX XML Cite \textit{M. R. Cerioli} et al., Discrete Math. 343, No. 3, Article ID 111717, 10 p. (2020; Zbl 1431.05051) Full Text: DOI arXiv OpenURL
Chen, Fuyuan Order of the smallest counterexample to Gallai’s conjecture. (English) Zbl 06890377 Czech. Math. J. 68, No. 2, 341-369 (2018). MSC: 05C38 05C12 05C70 05C75 PDF BibTeX XML Cite \textit{F. Chen}, Czech. Math. J. 68, No. 2, 341--369 (2018; Zbl 06890377) Full Text: DOI OpenURL
Golan, Gili; Shan, Songling Nonempty intersection of longest paths in \(2K_2\)-free graphs. (English) Zbl 1388.05099 Electron. J. Comb. 25, No. 2, Research Paper P2.37, 5 p. (2018). MSC: 05C38 05C69 PDF BibTeX XML Cite \textit{G. Golan} and \textit{S. Shan}, Electron. J. Comb. 25, No. 2, Research Paper P2.37, 5 p. (2018; Zbl 1388.05099) Full Text: arXiv Link OpenURL
Wiener, Gábor; Zamfirescu, Carol T. Gallai’s question and constructions of almost hypotraceable graphs. (English) Zbl 1387.05072 Discrete Appl. Math. 243, 270-278 (2018). MSC: 05C12 05C38 PDF BibTeX XML Cite \textit{G. Wiener} and \textit{C. T. Zamfirescu}, Discrete Appl. Math. 243, 270--278 (2018; Zbl 1387.05072) Full Text: DOI OpenURL
Ekstein, Jan; Fujita, Shinya; Kabela, Adam; Teska, Jakub Bounding the distance among longest paths in a connected graph. (English) Zbl 1380.05109 Discrete Math. 341, No. 4, 1155-1159 (2018). MSC: 05C38 05C12 05C40 PDF BibTeX XML Cite \textit{J. Ekstein} et al., Discrete Math. 341, No. 4, 1155--1159 (2018; Zbl 1380.05109) Full Text: DOI arXiv OpenURL
Cerioli, Márcia R.; Fernandes, Cristina G.; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma T. Transversals of longest paths. (English) Zbl 1383.05073 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 135-140 (2017). MSC: 05C12 05C38 05C40 PDF BibTeX XML Cite \textit{M. R. Cerioli} et al., Electron. Notes Discrete Math. 62, 135--140 (2017; Zbl 1383.05073) Full Text: DOI arXiv OpenURL
Chen, Guantao; Ehrenmüller, Julia; Fernandes, Cristina G.; Heise, Carl Georg; Shan, Songling; Yang, Ping; Yates, Amy N. Nonempty intersection of longest paths in series-parallel graphs. (English) Zbl 1351.05123 Discrete Math. 340, No. 3, 287-304 (2017). MSC: 05C38 05C12 05C10 PDF BibTeX XML Cite \textit{G. Chen} et al., Discrete Math. 340, No. 3, 287--304 (2017; Zbl 1351.05123) Full Text: DOI arXiv OpenURL
Cerioli, Márcia R.; Lima, Paloma Intersection of longest paths in graph classes. (English) Zbl 1356.05031 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 139-142 (2016). MSC: 05C12 05C38 05C42 90C27 PDF BibTeX XML Cite \textit{M. R. Cerioli} and \textit{P. Lima}, Electron. Notes Discrete Math. 55, 139--142 (2016; Zbl 1356.05031) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő; White, Susan C. Detour trees. (English) Zbl 1335.05099 Discrete Appl. Math. 206, 73-80 (2016). MSC: 05C38 05C05 05C12 05C35 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Discrete Appl. Math. 206, 73--80 (2016; Zbl 1335.05099) Full Text: DOI OpenURL
Chen, Fuyuan Nonempty intersection of longest paths in a graph with a small matching number. (English) Zbl 1363.05129 Czech. Math. J. 65, No. 2, 545-553 (2015). MSC: 05C38 05C70 05C75 05C12 PDF BibTeX XML Cite \textit{F. Chen}, Czech. Math. J. 65, No. 2, 545--553 (2015; Zbl 1363.05129) Full Text: DOI Link OpenURL
Joos, Felix A note on longest paths in circular arc graphs. (English) Zbl 1317.05102 Discuss. Math., Graph Theory 35, No. 3, 419-426 (2015). MSC: 05C38 PDF BibTeX XML Cite \textit{F. Joos}, Discuss. Math., Graph Theory 35, No. 3, 419--426 (2015; Zbl 1317.05102) Full Text: DOI arXiv OpenURL
de Rezende, Susanna F.; Fernandes, Cristina G.; Martin, Daniel M.; Wakabayashi, Yoshiko Intersecting longest paths. (English) Zbl 1279.05041 Discrete Math. 313, No. 12, 1401-1408 (2013). MSC: 05C38 05C10 05C05 05C45 PDF BibTeX XML Cite \textit{S. F. de Rezende} et al., Discrete Math. 313, No. 12, 1401--1408 (2013; Zbl 1279.05041) Full Text: DOI OpenURL
de Rezende, Susanna F.; Fernandes, Cristina G.; Martin, Daniel M.; Wakabayashi, Yoshiko Intersection of longest paths in a graph. (English) Zbl 1274.05263 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 743-748 (2011). MSC: 05C38 PDF BibTeX XML Cite \textit{S. F. de Rezende} et al., Electron. Notes Discrete Math. 38, 743--748 (2011; Zbl 1274.05263) Full Text: Link OpenURL
Axenovich, Maria When do three longest paths have a common vertex? (English) Zbl 1173.05024 Discrete Math. Algorithms Appl. 1, No. 1, 115-120 (2009). MSC: 05C38 PDF BibTeX XML Cite \textit{M. Axenovich}, Discrete Math. Algorithms Appl. 1, No. 1, 115--120 (2009; Zbl 1173.05024) Full Text: DOI OpenURL