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 | |
Publication status | Published - Jan 2015 |
Keywords
- EWI-25556
- MSC-05C
- Toughness
- k-Factor
- Best monotone degree conditions
- METIS-312475
- Connectivity
- IR-94141
- Binding number
- Hamiltonicity