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

Penn State Brandywine

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

35 Scopus citations

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 (US)
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
State	Published - Jan 2015

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/s00373-014-1465-6

Cite this

@article{80e7829d54c34cc2aec834af6a9de103,

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.",

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

note = "Publisher Copyright: {\textcopyright} 2014, Springer Japan.",

year = "2015",

month = jan,

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

language = "English (US)",

volume = "31",

pages = "1--22",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

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.

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.

UR - https://www.scopus.com/pages/publications/84921935923

UR - https://www.scopus.com/pages/publications/84921935923#tab=citedBy

U2 - 10.1007/s00373-014-1465-6

DO - 10.1007/s00373-014-1465-6

M3 - Article

AN - SCOPUS:84921935923

SN - 0911-0119

VL - 31

SP - 1

EP - 22

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

Best Monotone Degree Conditions for Graph Properties: A Survey

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this