Best monotone degree conditions for graph properties: a survey

D. Bauer, Haitze J. Broersma, J. van den Heuvel, N. Kahl, A. Nevo, E. Schmeichel, D.R. Woodall, M. Yatauro

    Research output: Contribution to journalArticleAcademicpeer-review

    17 Citations (Scopus)

    Abstract

    We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvátal’s well-known degree condition for hamiltonicity is best possible.
    Original languageUndefined
    Pages (from-to)1-22
    Number of pages22
    JournalGraphs and combinatorics
    Volume31
    Issue number1
    DOIs
    Publication statusPublished - Jan 2015

    Keywords

    • EWI-25556
    • MSC-05C
    • Toughness
    • k-Factor
    • Best monotone degree conditions
    • METIS-312475
    • Connectivity
    • IR-94141
    • Binding number
    • Hamiltonicity

    Cite this