Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord

DOI10.1002/jgt.20312zbMath1181.05056arXiv0711.2360OpenAlexW2950917523MaRDI QIDQ3630835

Etienne Birmelé

Publication date: 4 June 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

3-connectedminor free graphslongest circuit

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph minors (05C83)

Related Items (4)

A cycle of maximum order in a graph of high minimum degree has a chord ⋮ Chords in longest cycles ⋮ Removable edges and chords of longest cycles in 3-connected graphs ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Chords of longest circuits in locally planar graphs
• Chords of longest cycles in cubic graphs
• Chords of longest circuits in 3-connected graphs
• Longest cycles and their chords
• Chords of longest circuits of graphs embedded in torus and Klein bottle
• Unnamed Item

This page was built for publication: Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord