Degree sums, \(k\)-factors and Hamilton cycles in graphs (Q1805370)
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: Degree sums, \(k\)-factors and Hamilton cycles in graphs |
scientific article; zbMATH DE number 754147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree sums, \(k\)-factors and Hamilton cycles in graphs |
scientific article; zbMATH DE number 754147 |
Statements
Degree sums, \(k\)-factors and Hamilton cycles in graphs (English)
0 references
27 August 1995
0 references
The paper proves that if a 2-connected graph on \(n\) nodes with every pair of nonadjacent nodes having degree sum at least \(n-k\) has a \(k\)-factor, then the graph is Hamiltonian. This is a generalization of well-known results of Ore and Jackson.
0 references
Hamilton cycles
0 references
degree sum
0 references
\(k\)-factor
0 references
Hamiltonian
0 references
0.9518163
0 references
0 references
0 references
0.9156266
0 references
0.91196275
0 references
0.90862626
0 references
