Hamiltonism, degree sum and neighborhood intersections (Q1175978): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Evelyne Flandrin / rank
 
Normal rank
Property / author
 
Property / author: Heinz A. Jung / rank
 
Normal rank
Property / author
 
Property / author: Hao Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbourhood unions and Hamiltonian properties in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest paths and cycles in K1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in claw-free graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(91)90094-i / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047452025 / rank
 
Normal rank

Latest revision as of 09:22, 30 July 2024

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