Pages that link to "Item:Q3630835"
From MaRDI portal
The following pages link to Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord (Q3630835):
Displaying 9 items.
- Chords in longest cycles (Q684125) (← links)
- A refinement of Kuratowski's theorem (Q800369) (← links)
- Chords of longest circuits in 3-connected graphs (Q1398264) (← links)
- A cycle of maximum order in a graph of high minimum degree has a chord (Q1684648) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor. II (Q1931398) (← links)
- Removable edges and chords of longest cycles in 3-connected graphs (Q2014727) (← links)
- Results and problems on chorded cycles: a survey (Q2102760) (← links)
- A generalization of chordal graphs (Q3328563) (← links)
- Longest cycles and their chords (Q3794211) (← links)
