Long cycles, degree sums and neighborhood unions. - Haitze J. Broersma; Jan van den Heuvel; Henk Jan Veldman (Discret. Math., 1993)

A generalization of Ore's Theorem involving neighborhood unions. - Haitze J. Broersma; Jan van den Heuvel; Henk Jan Veldman (Discret. Math., 1993)

Long paths and cycles in tough graphs. - Haitze J. Broersma; Jan van den Heuvel; Heinz Adolf Jung; Henk Jan Veldman (Graphs Comb., 1993)

Cycles containing all vertices of maximum degree. - Haitze J. Broersma; Jan van den Heuvel; Heinz Adolf Jung; Henk Jan Veldman (J. Graph Theory, 1993)

Decomposition of bipartite graphs under degree constraints. - Haitze J. Broersma; Ralph J. Faudree; Jan van den Heuvel; Henk Jan Veldman (Networks, 1993)

Long cycles in graphs with prescribed toughness and minimum degree. - Douglas Bauer; Haitze J. Broersma; Jan van den Heuvel; Henk Jan Veldman (Discret. Math., 1995)

Pancyclicity of hamiltonian line graphs. - E. van Blanken; Jan van den Heuvel; Henk Jan Veldman (Discret. Math., 1995)

Long cycles in graphs containing a 2-factor with many odd components. - Jan van den Heuvel (Discret. Math., 1995)

Degree sums, k-factors and hamilton cycles in graphs. - Ralph J. Faudree; Jan van den Heuvel (Graphs Comb., 1995)

Toughness and Triangle-Free Graphs. - Douglas Bauer; Jan van den Heuvel; Edward F. Schmeichel (J. Comb. Theory B, 1995)

Relative length of long paths and cycles in graphs with large degree sums. - Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito (J. Graph Theory, 1995)

Extensions and consequences of Chvátal-Erdős' theorem. - Jan van den Heuvel (Graphs Comb., 1996)

On graphs satisfying a local ore-type condition. - Armen S. Asratian; Haitze J. Broersma; Jan van den Heuvel; Henk Jan Veldman (J. Graph Theory, 1996)

2-factors in triangle-free graphs. - Douglas Bauer; Jan van den Heuvel; Edward F. Schmeichel (J. Graph Theory, 1996)

Hamiltonicity of regular 2-connected graphs. - Haitze J. Broersma; Jan van den Heuvel; Bill Jackson; Henk Jan Veldman (J. Graph Theory, 1996)

Long cycles in graphs with large degree sums and neighborhood unions. - Jan van den Heuvel (J. Graph Theory, 1996)

The Complexity of Recognizing Tough Cubic Graphs. - Douglas Bauer; Jan van den Heuvel; Aurora Morgana; Edward F. Schmeichel (Discret. Appl. Math., 1997)

Removable Circuits in Multigraphs. - Luis A. Goddyn; Jan van den Heuvel; Sean McGuinness (J. Comb. Theory B, 1997)

Graph labeling and radio channel assignment. - Jan van den Heuvel; R. A. Leese; M. A. Shepherd (J. Graph Theory, 1998)

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs. - Jan van den Heuvel; Bill Jackson (J. Comb. Theory B, 1999)

Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems. - Jan van den Heuvel; Snezana Pejic (Ann. Oper. Res., 2001)

Algorithmic Aspects Of A Chip-Firing Game. - Jan van den Heuvel (Comb. Probab. Comput., 2001)

Heavy cycles in weighted graphs. - J. Adrian Bondy; Hajo Broersma; Jan van den Heuvel; Henk Jan Veldman (Discuss. Math. Graph Theory, 2002)

Coloring the square of a planar graph. - Jan van den Heuvel; Sean McGuinness (J. Graph Theory, 2003)

The External Network Problem with Edge- or Arc-Connectivity Requirements. - Jan van den Heuvel; Matthew Johnson 002 (CAAN, 2004)

On the Complexity of Ordered Colourings. - Jan van den Heuvel (ACiD, 2006)

A Linear Bound On The Diameter Of The Transportation Polytope. - Graham R. Brightwell; Jan van den Heuvel; Leen Stougie (Comb., 2006)

Frugal Colouring of Graphs - Omid Amini; Louis Esperet; Jan van den Heuvel (CoRR, 2007)

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. - Paul S. Bonsma; Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Electron. Notes Discret. Math., 2007)

List Colouring Squares of Planar Graphs. - Frédéric Havet; Jan van den Heuvel; Colin McDiarmid; Bruce A. Reed (Electron. Notes Discret. Math., 2007)

A new upper bound on the cyclic chromatic number. - Oleg V. Borodin; Hajo Broersma; Alexei N. Glebov; Jan van den Heuvel (J. Graph Theory, 2007)

Finding Paths Between 3-Colourings. - Matthew Johnson 002; Luis Cereceda; Jan van den Heuvel (IWOCA, 2008)

Connectedness of the graph of vertex-colourings. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Discret. Math., 2008)

Transversals of subtree hypergraphs and the source location problem in digraphs. - Jan van den Heuvel; Matthew Johnson 002 (Networks, 2008)

On the Complexity of Ordered Colorings. - Arvind Gupta; Jan van den Heuvel; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (SIAM J. Discret. Math., 2008)

A unified approach to distance-two colouring of planar graphs. - Omid Amini; Louis Esperet; Jan van den Heuvel (SODA, 2009)

Mixing 3-colourings in bipartite graphs. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Eur. J. Comb., 2009)

Preface. - Keith J. Edwards; Terry S. Griggs; Jan van den Heuvel; Stephanie Perkins; Bridget S. Webb; Vadim E. Zverovich (Discret. Math., 2010)

Finding paths between 3-colorings. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (J. Graph Theory, 2011)

Degree Sequences and the Existence of k-Factors. - Douglas Bauer; Haitze J. Broersma; Jan van den Heuvel; Nathan Kahl; Edward F. Schmeichel (Graphs Comb., 2012)

Cyclic orderings and cyclic arboricity of matroids. - Jan van den Heuvel; Stéphan Thomassé (J. Comb. Theory B, 2012)

The complexity of change. - Jan van den Heuvel (Surveys in Combinatorics, 2013)

A unified approach to distance-two colouring of graphs on surfaces. - Omid Amini; Louis Esperet; Jan van den Heuvel (Comb., 2013)

The Complexity of Change. - Jan van den Heuvel (CoRR, 2013)

Toughness and Vertex Degrees. - Douglas Bauer; Haitze J. Broersma; Jan van den Heuvel; Nathan Kahl; Edward F. Schmeichel (J. Graph Theory, 2013)

Fire Containment in Planar Graphs. - Louis Esperet; Jan van den Heuvel; Frédéric Maffray; Félix Sipma (J. Graph Theory, 2013)

Extensions of Fractional Precolorings Show Discontinuous Behavior. - Jan van den Heuvel; Daniel Král; Martin Kupec; Jean-Sébastien Sereni; Jan Volec (J. Graph Theory, 2014)

On the generalised colouring numbers of graphs that exclude a fixed minor. - Jan van den Heuvel; Patrice Ossona de Mendez; Roman Rabinovich 001; Sebastian Siebertz (Electron. Notes Discret. Math., 2015)

Best Monotone Degree Conditions for Graph Properties: A Survey. - Douglas Bauer; Hajo Broersma; Jan van den Heuvel; Nathan Kahl; Aori Nevo; Edward F. Schmeichel; Douglas R. Woodall; Michael Yatauro (Graphs Comb., 2015)

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. - Jan van den Heuvel; Stephan Kreutzer; Michal Pilipczuk; Daniel A. Quiroz; Roman Rabinovich 001; Sebastian Siebertz (LICS, 2017)

On the generalised colouring numbers of graphs that exclude a fixed minor. - Jan van den Heuvel; Patrice Ossona de Mendez; Daniel Quiroz 001; Roman Rabinovich 001; Sebastian Siebertz (Eur. J. Comb., 2017)

Extension from Precoloured Sets of Edges. - Katherine Edwards; António Girão; Jan van den Heuvel; Ross J. Kang; Gregory J. Puleo; Jean-Sébastien Sereni (Electron. J. Comb., 2018)

Improper colourings inspired by Hadwiger's conjecture. - Jan van den Heuvel; David R. Wood (J. Lond. Math. Soc., 2018)

Chromatic numbers of exact distance graphs. - Jan van den Heuvel; Hal A. Kierstead; Daniel A. Quiroz (J. Comb. Theory B, 2019)

Model-Checking on Ordered Structures. - Kord Eickmeyer; Jan van den Heuvel; Ken-ichi Kawarabayashi; Stephan Kreutzer; Patrice Ossona de Mendez; Michal Pilipczuk; Daniel A. Quiroz; Roman Rabinovich 001; Sebastian Siebertz (ACM Trans. Comput. Log., 2020)

Uniform orderings for generalized coloring numbers. - Jan van den Heuvel; Henry A. Kierstead (Eur. J. Comb., 2021)

Triangle-free graphs with the fewest independent sets. - Pjotr Buys; Jan van den Heuvel; Ross J. Kang (CoRR, 2025)

Determining a graph from its reconfiguration graph. - Gaétan Berthe; Caroline Brosse; Brian Hearn; Jan van den Heuvel; Pierre Hoppenot; Théo Pierron (CoRR, 2025)

Reconfiguration of List Colourings. - Stijn Cambie; Wouter Cames van Batenburg; Daniel W. Cranston; Jan van den Heuvel; Ross J. Kang (CoRR, 2025)