Detour trees

DOI10.1016/j.dam.2016.02.002zbMath1335.05099OpenAlexW4206682372MaRDI QIDQ277622

André E. Kézdy, Jenő Lehel, Adam S. Jobson, Susan Calcote White

Publication date: 2 May 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.02.002

zbMATH Keywords

cographsHelly propertycompatible treesdually chordal graphsintersecting longest cyclesintersecting longest paths

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (9)

Well-partitioned chordal graphs ⋮ All longest cycles in a 2‐connected partial 3‐tree share a common vertex ⋮ Transversals of longest cycles in partial k‐trees and chordal graphs ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Intersecting longest paths in chordal graphs ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Three problems on well-partitioned chordal graphs ⋮ Intersection of longest paths in graph classes ⋮ Transversals of longest paths

Cites Work

• Intersecting longest paths
• Complement reducible graphs
• Über längste Wege und Kreise in Graphen
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• On minimal vertex separators of dually chordal graphs: properties and characterizations
• HAMILTONian circuits in chordal bipartite graphs
• Computing and counting longest paths on circular-arc graphs in polynomial time
• On the correspondence between tree representations of chordal and dually chordal graphs
• A note on longest paths in circular arc graphs
• Smallest Sets of Longest Paths with Empty Intersection
• Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
• WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
• Dually Chordal Graphs
• Longest Paths in Circular Arc Graphs
• Transversals of Longest Paths and Cycles
• Intersecting longest paths and longest cycles: A survey
• On Detours in Graphs¹
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Detour trees