WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?

DOI10.1142/S1793830909000038zbMath1173.05024MaRDI QIDQ3634208

Maria A. Axenovich

Publication date: 23 June 2009

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

intersectionlongest paths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Detour trees, Intersecting longest paths, Intersecting longest paths in chordal graphs, Bounding the distance among longest paths in a connected graph, Unnamed Item, Nonempty intersection of longest paths in series-parallel graphs

Cites Work

• Stable set meeting every longest path
• Smallest Sets of Longest Paths with Empty Intersection
• Longest Paths in Circular Arc Graphs