Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers (Q1025522)

From MaRDI portal
Revision as of 23:15, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
scientific article

    Statements

    Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers (English)
    0 references
    0 references
    19 June 2009
    0 references
    0 references
    hamiltonicity
    0 references
    claw-free graph
    0 references
    quasi-claw-free graph
    0 references
    polynomial time algorithm
    0 references