| Coloring the square of a planar graph J van den Heuvel, S McGuinness Journal of Graph Theory 42 (2), 110-124, 2003 | 291 | 2003 |
| Graph labeling and radio channel assignment J van den Heuvel, RA Leese, MA Shepherd Journal of Graph Theory 29 (4), 263-283, 1998 | 281 | 1998 |
| The complexity of change. J van den Heuvel Surveys in combinatorics 409 (2013), 127-160, 2013 | 280 | 2013 |
| Finding paths between 3‐colorings L Cereceda, J van den Heuvel, M Johnson Journal of graph theory 67 (1), 69-82, 2011 | 187 | 2011 |
| Connectedness of the graph of vertex-colourings L Cereceda, J van den Heuvel, M Johnson Discrete Mathematics 308 (5), 913-919, 2008 | 152 | 2008 |
| Minimal degrees and chromatic numbers of squares of planar graphs OV Borodin, H Broersma, AN Glebov, J van den Heuvel Diskretnyi Analiz i Issledovanie Operatsii 8 (4), 9-33, 2001 | 123* | 2001 |
| Hamilton cycles and eigenvalues of graphs J van den Heuvel Linear algebra and its applications 226, 723-730, 1995 | 96 | 1995 |
| Mixing 3-colourings in bipartite graphs L Cereceda, J van den Heuvel, M Johnson European Journal of Combinatorics 30 (7), 1593-1606, 2009 | 91 | 2009 |
| List colouring squares of planar graphs F Havet, J van den Heuvel, C McDiarmid, B Reed Electronic Notes in Discrete Mathematics 29, 515-519, 2007 | 89 | 2007 |
| On the generalised colouring numbers of graphs that exclude a fixed minor J van den Heuvel, P Ossona de Mendez, D Quiroz, R Rabinovich, ... European Journal of Combinatorics 66, 129-144, 2017 | 69 | 2017 |
| Improper Colourings inspired by Hadwiger's Conjecture J van den Heuvel, DR Wood Journal of the London Mathematical Society. Second Series 98 (1), 129-148, 2018 | 57 | 2018 |
| A unified approach to distance-two colouring of graphs on surfaces O Amini, L Esperet, J van den Heuvel Combinatorica 33 (3), 253-296, 2013 | 53* | 2013 |
| A generalization of Ore's Theorem involving neighborhood unions HJ Broersma, J van den Heuvel, HJ Veldman Discrete mathematics 122 (1-3), 37-49, 1993 | 47 | 1993 |
| A Linear Bound On The Diameter Of The Transportation Polytope G Brightwell, J van den Heuvel, L Stougie Combinatorica 26 (2), 133-139, 2006 | 45 | 2006 |
| Heavy cycles in weighted graphs JA Bondy, HJ Broersma, J van den Heuvel, HJ Veldman Discussiones Mathematicae Graph Theory 22 (1), 7-15, 2002 | 45 | 2002 |
| Long cycles in graphs with prescribed toughness and minimum degree D Bauer, HJ Broersma, J van den Heuvel, HJ Veldman Discrete mathematics 141 (1-3), 1-10, 1995 | 44 | 1995 |
| Algorithmic aspects of a chip-firing game J van den Heuvel Combinatorics, Probability and Computing 10 (06), 505-529, 2001 | 42 | 2001 |
| Heavy cycles in weighted graphs JA Bondy, HJ Broersma, J van den Heuvel, HJ Veldman Discussiones Mathematicae Graph Theory 22 (1), 7-16, 2002 | 41 | 2002 |
| Relative length of long paths and cycles in graphs with large degree sums H Enomoto, J van den Heuvel, A Kaneko, A Saito Journal of Graph Theory 20 (2), 213-225, 1995 | 40 | 1995 |
| Best monotone degree conditions for graph properties: a survey D Bauer, HJ Broersma, J van den Heuvel, N Kahl, A Nevo, E Schmeichel, ... Graphs and combinatorics 31, 1-22, 2015 | 33 | 2015 |
Hajo BroersmaFaculty EEMCS, University of Twente, NLutwente.nl의 이메일 확인됨
