Hamiltonism, degree sum and neighborhood intersections (Q1175978)

From MaRDI portal
Revision as of 18:13, 10 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Hamiltonism, degree sum and neighborhood intersections
scientific article

    Statements

    Hamiltonism, degree sum and neighborhood intersections (English)
    0 references
    25 June 1992
    0 references
    A 2-connected graph of order \(n\) is Hamiltonian if, for any three pairwise nonadjacent vertices, the degree sum is at least \(n\) plus the cardinality of the intersection of the three neighborhoods.
    0 references
    Hamiltonism
    0 references
    degree sum
    0 references
    neighborhood intersections
    0 references
    0 references
    0 references
    0 references

    Identifiers