Toughness in graphs -- a survey (Q2494126)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Toughness in graphs -- a survey
scientific article

    Statements

    Toughness in graphs -- a survey (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamilton cycle
    0 references
    Hamiltonian graph
    0 references
    Traceable graph
    0 references
    Circumference
    0 references
    Factor
    0 references
    Chordal graph
    0 references
    Triangle-free graph
    0 references
    Planar graph
    0 references
    Computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references