| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903886 | Journal of Combinatorial Theory, Series B | 2018 | 10 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carsten Thomassen,