Jan van den Heuvel

Orcid: 0000-0003-0897-9148

  • Department of Mathematics, London School of Economics and Political Science, London, UK

According to our database1, Jan van den Heuvel authored at least 56 papers between 1993 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Uniform orderings for generalized coloring numbers.
Eur. J. Comb., 2021

Model-Checking on Ordered Structures.
ACM Trans. Comput. Log., 2020

Chromatic numbers of exact distance graphs.
J. Comb. Theory B, 2019

Improper colourings inspired by Hadwiger's conjecture.
J. Lond. Math. Soc., 2018

Extension from Precoloured Sets of Edges.
Electron. J. Comb., 2018

On the generalised colouring numbers of graphs that exclude a fixed minor.
Eur. J. Comb., 2017

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Best Monotone Degree Conditions for Graph Properties: A Survey.
Graphs Comb., 2015

On the generalised colouring numbers of graphs that exclude a fixed minor.
Electron. Notes Discret. Math., 2015

Extensions of Fractional Precolorings Show Discontinuous Behavior.
J. Graph Theory, 2014

Fire Containment in Planar Graphs.
J. Graph Theory, 2013

Toughness and Vertex Degrees.
J. Graph Theory, 2013

The Complexity of Change.
CoRR, 2013

A unified approach to distance-two colouring of graphs on surfaces.
Comb., 2013

The complexity of change.
Proceedings of the Surveys in Combinatorics 2013, 2013

Cyclic orderings and cyclic arboricity of matroids.
J. Comb. Theory B, 2012

Degree Sequences and the Existence of k-Factors.
Graphs Comb., 2012

Finding paths between 3-colorings.
J. Graph Theory, 2011

Discret. Math., 2010

Mixing 3-colourings in bipartite graphs.
Eur. J. Comb., 2009

A unified approach to distance-two colouring of planar graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On the Complexity of Ordered Colorings.
SIAM J. Discret. Math., 2008

Transversals of subtree hypergraphs and the source location problem in digraphs.
Networks, 2008

Connectedness of the graph of vertex-colourings.
Discret. Math., 2008

Finding Paths Between 3-Colourings.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

A new upper bound on the cyclic chromatic number.
J. Graph Theory, 2007

List Colouring Squares of Planar Graphs.
Electron. Notes Discret. Math., 2007

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances.
Electron. Notes Discret. Math., 2007

Frugal Colouring of Graphs
CoRR, 2007

A Linear Bound On The Diameter Of The Transportation Polytope.
Comb., 2006

On the Complexity of Ordered Colourings.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

The External Network Problem with Edge- or Arc-Connectivity Requirements.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

Coloring the square of a planar graph.
J. Graph Theory, 2003

Heavy cycles in weighted graphs.
Discuss. Math. Graph Theory, 2002

Algorithmic Aspects Of A Chip-Firing Game.
Comb. Probab. Comput., 2001

Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems.
Ann. Oper. Res., 2001

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs.
J. Comb. Theory B, 1999

Graph labeling and radio channel assignment.
J. Graph Theory, 1998

Removable Circuits in Multigraphs.
J. Comb. Theory B, 1997

The Complexity of Recognizing Tough Cubic Graphs.
Discret. Appl. Math., 1997

Long cycles in graphs with large degree sums and neighborhood unions.
J. Graph Theory, 1996

Hamiltonicity of regular 2-connected graphs.
J. Graph Theory, 1996

2-factors in triangle-free graphs.
J. Graph Theory, 1996

On graphs satisfying a local ore-type condition.
J. Graph Theory, 1996

Extensions and consequences of Chvátal-Erdős' theorem.
Graphs Comb., 1996

Relative length of long paths and cycles in graphs with large degree sums.
J. Graph Theory, 1995

Toughness and Triangle-Free Graphs.
J. Comb. Theory B, 1995

Degree sums, <i>k</i>-factors and hamilton cycles in graphs.
Graphs Comb., 1995

Long cycles in graphs containing a 2-factor with many odd components.
Discret. Math., 1995

Pancyclicity of hamiltonian line graphs.
Discret. Math., 1995

Long cycles in graphs with prescribed toughness and minimum degree.
Discret. Math., 1995

Decomposition of bipartite graphs under degree constraints.
Networks, 1993

Cycles containing all vertices of maximum degree.
J. Graph Theory, 1993

Long paths and cycles in tough graphs.
Graphs Comb., 1993

A generalization of Ore's Theorem involving neighborhood unions.
Discret. Math., 1993

Long cycles, degree sums and neighborhood unions.
Discret. Math., 1993