Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs (Q2706129)

From MaRDI portal
Revision as of 08:07, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
scientific article

    Statements

    Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2001
    0 references
    claw-free graphs
    0 references
    (claw, net)-free graphs
    0 references
    Hamiltonian path
    0 references
    Hamiltonian cycle
    0 references
    dominating pair
    0 references
    dominating path
    0 references
    linear time algorithms
    0 references

    Identifiers

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