A new approach towards a conjecture on intersecting three longest paths
From MaRDI portal
Publication:1713782
DOI10.4310/JOC.2019.V10.N2.A2zbMATH Open1403.05072arXiv1503.01219OpenAlexW2962838774WikidataQ122946018 ScholiaQ122946018MaRDI QIDQ1713782FDOQ1713782
Shinya Fujita, Michitaka Furuya, Kenta Ozeki, Reza Naserasr
Publication date: 28 January 2019
Published in: Journal of Combinatorics (Search for Journal in Brave)
Abstract: In 1966, T. Gallai asked whether every connected graph has a vertex that appears in all longest paths. Since then this question has attracted much attention and many work has been done in this topic. One important open question in this area is to ask whether any three longest paths contains a common vertex in a connected graph. It was conjectured that the answer to this question is positive. In this paper, we propose a new approach in view of distances among longest paths in a connected graph, and give a substantial progress towards the conjecture along the idea.
Full work available at URL: https://arxiv.org/abs/1503.01219
Cited In (1)
Recommendations
- Title not available (Why is that?) 👍 👎
- Intersecting longest paths and longest cycles: A survey 👍 👎
- New results on shortest paths in three dimensions 👍 👎
- Intersection of longest paths in a graph 👍 👎
- A Mengerian theorem for paths of length at least three 👍 👎
- On longest paths in triangular lattice graphs 👍 👎
- Intersecting longest paths in chordal graphs 👍 👎
- Discrete and Computational Geometry 👍 👎
- Intersection of longest paths in graph classes 👍 👎
- Intersection of longest paths in graph classes 👍 👎
This page was built for publication: A new approach towards a conjecture on intersecting three longest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713782)
