Hamilton cycles in regular 3-connected graphs (Q1208363): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90712-o / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1963734119 / rank | |||
Normal rank |
Latest revision as of 10:04, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamilton cycles in regular 3-connected graphs |
scientific article |
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