Best monotone degree conditions for graph properties: a survey

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

doi:10.1007/s00373-014-1465-6

Best monotone degree conditions for graph properties: a survey

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

Research output: Contribution to journal › Article › Academic › peer-review

34 Citations (Scopus)

50 Downloads (Pure)

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 language	English
Pages (from-to)	1-22
Number of pages	22
Journal	Graphs and combinatorics
Volume	31
Issue number	1
DOIs	https://doi.org/10.1007/s00373-014-1465-6
Publication status	Published - Jan 2015

Keywords

MSC-05C
Toughness
k-Factor
Best monotone degree conditions
Connectivity
Binding number
Hamiltonicity
2024 OA procedure

Access to Document

10.1007/s00373-014-1465-6

ArticleFinal published version, 324 KBLicence: Taverne

Cite this

@article{2a99fd98ff5c407f9e9e9b7d7a101f36,

title = "Best monotone degree conditions for graph properties: a survey",

abstract = "We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chv{\'a}tal{\textquoteright}s well-known degree condition for hamiltonicity is best possible.",

keywords = "MSC-05C, Toughness, k-Factor, Best monotone degree conditions, Connectivity, Binding number, Hamiltonicity, 2024 OA procedure",

author = "D. Bauer and H.J. Broersma and \{van den Heuvel\}, J. and N. Kahl and A. Nevo and E. Schmeichel and D.R. Woodall and M. Yatauro",

note = "eemcs-eprint-25556 ",

year = "2015",

month = jan,

doi = "10.1007/s00373-014-1465-6",

language = "English",

volume = "31",

pages = "1--22",

journal = "Graphs and combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - Best monotone degree conditions for graph properties

T2 - a survey

AU - Bauer, D.

AU - Broersma, H.J.

AU - van den Heuvel, J.

AU - Kahl, N.

AU - Nevo, A.

AU - Schmeichel, E.

AU - Woodall, D.R.

AU - Yatauro, M.

N1 - eemcs-eprint-25556

PY - 2015/1

Y1 - 2015/1

N2 - 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.

AB - 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.

KW - MSC-05C

KW - Toughness

KW - k-Factor

KW - Best monotone degree conditions

KW - Connectivity

KW - Binding number

KW - Hamiltonicity

KW - 2024 OA procedure

U2 - 10.1007/s00373-014-1465-6

DO - 10.1007/s00373-014-1465-6

M3 - Article

SN - 0911-0119

VL - 31

SP - 1

EP - 22

JO - Graphs and combinatorics

JF - Graphs and combinatorics

IS - 1

ER -