Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
AXENOVICH, MARIA
2009.
WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?.
Discrete Mathematics, Algorithms and Applications,
Vol. 01,
Issue. 01,
p.
115.
de Rezende, Susanna F.
Fernandes, Cristina G.
Martin, Daniel M.
and
Wakabayashi, Yoshiko
2011.
Intersection of Longest Paths in a Graph.
Electronic Notes in Discrete Mathematics,
Vol. 38,
Issue. ,
p.
743.
de Rezende, Susanna F.
Fernandes, Cristina G.
Martin, Daniel M.
and
Wakabayashi, Yoshiko
2013.
Intersecting longest paths.
Discrete Mathematics,
Vol. 313,
Issue. 12,
p.
1401.
Rautenbach, Dieter
and
Sereni, Jean-Sébastien
2014.
Transversals of Longest Paths and Cycles.
SIAM Journal on Discrete Mathematics,
Vol. 28,
Issue. 1,
p.
335.
Chen, Fuyuan
2015.
Nonempty intersection of longest paths in a graph with a small matching number.
Czechoslovak Mathematical Journal,
Vol. 65,
Issue. 2,
p.
545.
Jobson, Adam S.
Kézdy, André E.
Lehel, Jenő
and
White, Susan C.
2016.
Detour trees.
Discrete Applied Mathematics,
Vol. 206,
Issue. ,
p.
73.
Cerioli, Márcia R.
and
Lima, Paloma
2016.
Intersection of Longest Paths in Graph Classes.
Electronic Notes in Discrete Mathematics,
Vol. 55,
Issue. ,
p.
139.
Cerioli, Márcia R.
Fernandes, Cristina G.
Gómez, Renzo
Gutiérrez, Juan
and
Lima, Paloma T.
2017.
Transversals of Longest Paths.
Electronic Notes in Discrete Mathematics,
Vol. 62,
Issue. ,
p.
135.
Chen, Guantao
Ehrenmüller, Julia
Fernandes, Cristina G.
Heise, Carl Georg
Shan, Songling
Yang, Ping
and
Yates, Amy N.
2017.
Nonempty intersection of longest paths in series–parallel graphs.
Discrete Mathematics,
Vol. 340,
Issue. 3,
p.
287.
Gutiérrez, Juan
2018.
LATIN 2018: Theoretical Informatics.
Vol. 10807,
Issue. ,
p.
558.
Wiener, Gábor
and
Zamfirescu, Carol T.
2018.
Gallai’s question and constructions of almost hypotraceable graphs.
Discrete Applied Mathematics,
Vol. 243,
Issue. ,
p.
270.
Ekstein, Jan
Fujita, Shinya
Kabela, Adam
and
Teska, Jakub
2018.
Bounding the distance among longest paths in a connected graph.
Discrete Mathematics,
Vol. 341,
Issue. 4,
p.
1155.
Cerioli, Márcia R.
and
Lima, Paloma T.
2020.
Intersection of longest paths in graph classes.
Discrete Applied Mathematics,
Vol. 281,
Issue. ,
p.
96.
Cerioli, Márcia R.
Fernandes, Cristina G.
Gómez, Renzo
Gutiérrez, Juan
and
Lima, Paloma T.
2020.
Transversals of longest paths.
Discrete Mathematics,
Vol. 343,
Issue. 3,
p.
111717.
Ahn, Jungho
Jaffke, Lars
Kwon, O-joung
and
Lima, Paloma T.
2021.
Algorithms and Complexity.
Vol. 12701,
Issue. ,
p.
23.
Wiener, Gábor
Yokota, Maho
and
Zamfirescu, Carol T.
2021.
Spiders everywhere.
Discrete Applied Mathematics,
Vol. 289,
Issue. ,
p.
516.
Ahn, Jungho
Jaffke, Lars
Kwon, O-joung
and
Lima, Paloma T.
2022.
Well-partitioned chordal graphs.
Discrete Mathematics,
Vol. 345,
Issue. 10,
p.
112985.
Zhao, Qinghong
Wei, Bing
and
Wu, Haidong
2023.
Bonds Intersecting Long Paths in \(k\) -Connected Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 37,
Issue. 2,
p.
733.
Harvey, Daniel J.
and
Payne, Michael S.
2023.
Intersecting longest paths in chordal graphs.
Discrete Mathematics,
Vol. 346,
Issue. 4,
p.
113284.
Gutiérrez, Juan
2023.
All longest cycles in a 2‐connected partial 3‐tree share a common vertex.
Journal of Graph Theory,
Vol. 103,
Issue. 4,
p.
690.