Degree sums, \(k\)-factors and Hamilton cycles in graphs (Q1805370)

From MaRDI portal
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
    0 references
    Hamilton cycles
    0 references
    degree sum
    0 references
    \(k\)-factor
    0 references
    Hamiltonian
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references