Hamilton cycles in regular 3-connected graphs (Q1208363)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamilton cycles in regular 3-connected graphs |
scientific article; zbMATH DE number 166365
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamilton cycles in regular 3-connected graphs |
scientific article; zbMATH DE number 166365 |
Statements
Hamilton cycles in regular 3-connected graphs (English)
0 references
16 May 1993
0 references
Let \(G\) be a 3-connected \(k\)-regular graph on \(n\) vertices. It is known that \(G\) is Hamiltonian if \(k\geq 14\) and \(n\leq 3k+4\), and it has been conjectured that even \(k\geq 4\) and \(n\geq 4k\) imply Hamiltonicity. In the present paper it is shown that \(G\) is Hamiltonian if \(k\geq 63\) and \(n\leq{22\over 7}k\).
0 references
Hamiltonian graphs
0 references
Hamilton cycles
0 references
regular graph
0 references
Hamiltonicity
0 references