Toughness in graphs -- a survey (Q2494126)

From MaRDI portal
Revision as of 16:13, 24 June 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
Toughness in graphs -- a survey
scientific article

    Statements

    title
    Toughness in graphs -- a survey (English)
    0 references
    author
    Douglas Bauer
    0 references
    Hajo J. Broersma
    0 references
    Edward F. Schmeichel
    0 references
    publication date
    16 June 2006
    0 references
    zbMATH Keywords
    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
    cites work
    Q3781786
    0 references
    Q3789603
    0 references
    Q5708558
    0 references
    Q3971997
    0 references
    Q4856626
    0 references
    Q4489197
    0 references
    Q3984510
    0 references
    Q4873795
    0 references
    Q3976600
    0 references
    Q4871126
    0 references
    Q4405806
    0 references
    Q4094891
    0 references
    Q3866156
    0 references
    Large cycles in graphs
    0 references
    Pancyclic graphs. I
    0 references
    Q5688996
    0 references
    Q4350166
    0 references
    Q4032983
    0 references
    Q4378526
    0 references
    On Hamilton's ideals
    0 references
    Q5187226
    0 references
    Q3684150
    0 references
    On Path-Tough Graphs
    0 references
    Q4014317
    0 references
    Q4288154
    0 references
    Q5466048
    0 references
    Q4198056
    0 references
    Q4873831
    0 references
    Q3328583
    0 references
    Q4326197
    0 references
    Q3356326
    0 references
    Q4873754
    0 references
    Q2715952
    0 references
    Q4949854
    0 references
    Matching theory
    0 references
    Ramanujan graphs
    0 references
    Q5591387
    0 references
    Q5628163
    0 references
    Q4518404
    0 references
    Q4711931
    0 references
    Q4390654
    0 references
    Q3724373
    0 references
    Q5790850
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C40
    0 references
    05C45
    0 references
    68R10
    0 references
    05-02
    0 references
    zbMATH DE Number
    5033626
    0 references
    OpenAlex ID
    W2001161770
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2494126&oldid=34880697"
    Powered by MediaWiki