Chords of longest cycles in cubic graphs (Q1386433): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q210144 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Brian Alspach / rank | |||
Normal rank | |||
Revision as of 03:24, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chords of longest cycles in cubic graphs |
scientific article |
Statements
Chords of longest cycles in cubic graphs (English)
0 references
14 January 1999
0 references
The author determines a condition which is sufficient to guarantee the existence of a second Hamilton cycle in a Hamiltonian graph. He uses this to prove that every longest cycle in a 3-connected cubic graph has a chord, and other results on the existence of a second Hamilton cycle.
0 references
