A new approach towards a conjecture on intersecting three longest paths
From MaRDI portal
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.
Recommendations
- Intersecting longest paths and longest cycles: a survey
- Long paths through specified vertices in \(3\)-connected graphs
- A Mengerian theorem for paths of length at least three
- On longest paths in triangular lattice graphs
- A new approach to the path partition conjecture
- Intersection of longest paths in graph classes
- Intersection of longest paths in graph classes
- New results on shortest paths in three dimensions
- Intersecting longest paths in chordal graphs
- Intersection of longest paths in a graph
Cited in
(4)
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)
