Chords of longest circuits in 3-connected graphs
From MaRDI portal
Publication:1398264
A conjecture of Thomassen says that every longest circuit of a 3-connected graph has a chord. This paper shows this to be true for a 3-connected graph embedded in a projective plane, having minimum degree 4.
Recommendations
Cited in
(15)- Chords of longest cycles in cubic graphs
- A cycle of maximum order in a graph of high minimum degree has a chord
- Removable edges and chords of longest cycles in 3-connected graphs
- Results and problems on chorded cycles: a survey
- A generalization of chordal graphs
- Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord
- Longest cycles and their chords
- Strings of length 3 in grand-Dyck paths and the Chung-Feller property
- Chords of longest circuits of graphs embedded in torus and Klein bottle
- Chords in longest cycles
- Chords of longest cycles passing through a specified small set
- Longest cycles and longest chordless cycles in 2-connected graphs
- Chords of longest cycles in 3-connected graphs with some special circumferences
- Chords of longest cycles in graphs with large circumferences
- Chords of longest circuits in locally planar graphs
This page was built for publication: Chords of longest circuits in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398264)