Bounding the distance among longest paths in a connected graph

DOI10.1016/j.disc.2017.09.029zbMath1380.05109arXiv1607.08850OpenAlexW2964030017MaRDI QIDQ1699570

Jakub Teska, Jan Ekstein, Shinya Fujita, Adam Kabela

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08850

zbMATH Keywords

longest pathspath intersection

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersecting longest paths
• Planar and infinite hypohamiltonian and hypotraceable graphs
• A new approach towards a conjecture on intersecting three longest paths
• Smallest Sets of Longest Paths with Empty Intersection
• WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
• On longest paths and circuits in graphs.
• Longest Paths in Circular Arc Graphs
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

This page was built for publication: Bounding the distance among longest paths in a connected graph