1-tough cocomparability graphs are hamiltonian (Q1363656)

From MaRDI portal
Revision as of 18:10, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
1-tough cocomparability graphs are hamiltonian
scientific article

    Statements

    1-tough cocomparability graphs are hamiltonian (English)
    0 references
    0 references
    0 references
    0 references
    10 August 1997
    0 references
    0 references
    1-tough cocomparability graph
    0 references
    Hamilton cycle
    0 references
    cocomparability graphs
    0 references
    scattering number
    0 references
    path cover number
    0 references