All longest cycles intersect in partial 3-trees

2021/03/09 by Gutiérrez, Juan
#05C38 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2

paper · doi:10.48550/arxiv.2103.05186

Abstract

We show that all longest cycles intersect in 2-connected partial 3-trees.

Related

• Transversals of Longest Cycles in Partial k-Trees and Chordal Graphs
• Longest cycles and their chords
• Chords of longest cycles in graphs with large circumferences
• Longest cycles in vertex-transitive and highly connected graphs
• Chords of longest cycles passing through a specified small set