Abstract
If a graph G is 3-connected and has minimum degree at least 4, then some longest cycle in G has a chord. If G is 2-connected and cubic, then every longest cycle in G has a chord.
| Original language | English |
|---|---|
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 129 |
| Pages (from-to) | 148-157 |
| ISSN | 0095-8956 |
| DOIs | |
| Publication status | Published - 2017 |
Keywords
- Chords
- Connectivity
- Longest cycles
Fingerprint
Dive into the research topics of 'Chords in longest cycles'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver