Degree sums, \(k\)-factors and Hamilton cycles in graphs (Q1805370): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3971997 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Long cycles in graphs with large degree sums / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The binding number of a graph and its Anderson number / rank | |||
Normal rank | |||
Revision as of 13:21, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree sums, \(k\)-factors and Hamilton cycles in graphs |
scientific article |
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
