![]() | Up a level |
Bauer, D., Broersma, H. J., van den Heuvel, Jan ORCID: 0000-0003-0897-9148, Kahl, N., Nevo, A., Schmeichel, E., Woodall, D. R. and Yatauro, M.
(2014)
Best monotone degree conditions for graph properties: a survey.
Graphs and Combinatorics, 31 (1).
ISSN 0911-0119
Bauer, D., Broersma, H. J., van den Heuvel, J. ORCID: 0000-0003-0897-9148, Kahl, N. and Schmeichel, E.
(2013)
Toughness and vertex degrees.
Journal of Graph Theory, 72 (2).
pp. 209-219.
ISSN 0364-9024
Bauer, D., Broersma, H. J., van den Heuvel, Jan ORCID: 0000-0003-0897-9148, Kahl, N. and Schmeichel, E.
(2012)
Degree sequences and the existence of k-Factors.
Graphs and Combinatorics, 28 (2).
pp. 149-166.
ISSN 0911-0119
Bauer, D., Broersma, H. J., van den Heuvel, J. ORCID: 0000-0003-0897-9148, Kahl, N. and Schmeichel, E.
(2009)
Degree sequences and the existence of k-factors.
.
arXiv.
Borodin, O. V., Broersma, H. J., Glebov, A. and van den Heuvel, Jan ORCID: 0000-0003-0897-9148
(2004)
A new upper bound on the cyclic chromatic number.
CDAM research report series (LSE-CDAM-2004-04).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.