Chords of longest cycles in cubic graphs (Q1386433)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1154572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chords of longest cycles in cubic graphs |
scientific article; zbMATH DE number 1154572 |
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
0 references
0.8795032501220703
0 references
0.8293055891990662
0 references
0.8104308247566223
0 references
0.7842071056365967
0 references
