Abstract
| Original language | Undefined |
|---|---|
| Pages (from-to) | 1-22 |
| Number of pages | 22 |
| Journal | Graphs and combinatorics |
| Volume | 31 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2015 |
Keywords
- EWI-25556
- MSC-05C
- Toughness
- k-Factor
- Best monotone degree conditions
- METIS-312475
- Connectivity
- IR-94141
- Binding number
- Hamiltonicity
Cite this
}
Best monotone degree conditions for graph properties: a survey. / Bauer, D.; Broersma, Haitze J.; van den Heuvel, J.; Kahl, N.; Nevo, A.; Schmeichel, E.; Woodall, D.R.; Yatauro, M.
In: Graphs and combinatorics, Vol. 31, No. 1, 01.2015, p. 1-22.Research output: Scientific - peer-review › Article
TY - JOUR
T1 - Best monotone degree conditions for graph properties: a survey
AU - Bauer,D.
AU - Broersma,Haitze 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 - EWI-25556
KW - MSC-05C
KW - Toughness
KW - k-Factor
KW - Best monotone degree conditions
KW - METIS-312475
KW - Connectivity
KW - IR-94141
KW - Binding number
KW - Hamiltonicity
U2 - 10.1007/s00373-014-1465-6
DO - 10.1007/s00373-014-1465-6
M3 - Article
VL - 31
SP - 1
EP - 22
JO - Graphs and combinatorics
T2 - Graphs and combinatorics
JF - Graphs and combinatorics
SN - 0911-0119
IS - 1
ER -