Intersecting longest paths in chordal graphs

DOI10.1016/j.disc.2022.113284OpenAlexW3112965832MaRDI QIDQ2685319

Daniel J. Harvey, Michael S. Payne

Publication date: 21 February 2023

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

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

zbMATH Keywords

transversalschordal graphslongest paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Transversal (matching) theory (05D15)

Related Items (1)

Bonds Intersecting Long Paths in \(k\) -Connected Graphs

Cites Work

• Detour trees
• Intersecting longest paths
• Nonempty intersection of longest paths in series-parallel graphs
• Planar and infinite hypohamiltonian and hypotraceable graphs
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• Transversals of longest cycles in chordal and bounded tree-width graphs
• A note on longest paths in circular arc graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Nonempty intersection of longest paths in a graph with a small matching number
• New upper bounds on the decomposability of planar graphs
• WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
• On longest paths and circuits in graphs.
• Longest Paths in Circular Arc Graphs
• Transversals of Longest Paths and Cycles
• On Detours in Graphs¹
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Intersection of longest paths in graph classes
• Transversals of longest paths
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intersecting longest paths in chordal graphs