Jan van den Heuvel

64 papers A* 2B 1C 1Journal 57Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Determining a graph from its reconfiguration graph. CoRR Gaétan Berthe, Caroline Brosse, Brian Hearn, Jan van den Heuvel, Pierre Hoppenot, Théo Pierron
2025	J	`jnl`	Reconfiguration of List Colourings. CoRR Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston, Jan van den Heuvel, Ross J. Kang
2025	J	`jnl`	Triangle-free graphs with the fewest independent sets. CoRR Pjotr Buys, Jan van den Heuvel, Ross J. Kang
2021	J	`jnl`	Uniform orderings for generalized coloring numbers. Eur. J. Comb. Jan van den Heuvel, Henry A. Kierstead
2020	J	`jnl`	Model-Checking on Ordered Structures. ACM Trans. Comput. Log. Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2019	J	`jnl`	Chromatic numbers of exact distance graphs. J. Comb. Theory B Jan van den Heuvel, Hal A. Kierstead, Daniel A. Quiroz
2019	J	`jnl`	Uniform Orderings for Generalized Coloring Numbers. CoRR Jan van den Heuvel, Hal A. Kierstead
2018	J	`jnl`	Extension from Precoloured Sets of Edges. Electron. J. Comb. Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni
2018	J	`jnl`	Improper colourings inspired by Hadwiger's conjecture. J. Lond. Math. Soc. Jan van den Heuvel, David R. Wood
2018	J	`jnl`	Model-Checking on Ordered Structures. CoRR Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2017	J	`jnl`	Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion. CoRR Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2017	A*	`conf`	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2017	J	`jnl`	On the generalised colouring numbers of graphs that exclude a fixed minor. Eur. J. Comb. Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz
2016	J	`jnl`	On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor. CoRR Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz
2015	J	`jnl`	Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
2015	J	`jnl`	On the generalised colouring numbers of graphs that exclude a fixed minor. Electron. Notes Discret. Math. Jan van den Heuvel, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
2014	J	`jnl`	Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec
2013	J	`jnl`	A unified approach to distance-two colouring of graphs on surfaces. Comb. Omid Amini, Louis Esperet, Jan van den Heuvel
2013	J	`jnl`	Fire Containment in Planar Graphs. J. Graph Theory Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma
2013	J	`jnl`	The Complexity of Change. CoRR Jan van den Heuvel
2013	—	`ch.`	The complexity of change. Surveys in Combinatorics Jan van den Heuvel
2013	J	`jnl`	Toughness and Vertex Degrees. J. Graph Theory Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
2012	J	`jnl`	Cyclic orderings and cyclic arboricity of matroids. J. Comb. Theory B Jan van den Heuvel, Stéphan Thomassé
2012	J	`jnl`	Degree Sequences and the Existence of k-Factors. Graphs Comb. Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
2011	J	`jnl`	Finding paths between 3-colorings. J. Graph Theory Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2010	J	`jnl`	Preface. Discret. Math. Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich
2009	A*	`conf`	A unified approach to distance-two colouring of planar graphs. SODA Omid Amini, Louis Esperet, Jan van den Heuvel
2009	J	`jnl`	Mixing 3-colourings in bipartite graphs. Eur. J. Comb. Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2008	J	`jnl`	Connectedness of the graph of vertex-colourings. Discret. Math. Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2008	C	`conf`	Finding Paths Between 3-Colourings. IWOCA Matthew Johnson, Luis Cereceda, Jan van den Heuvel
2008	J	`jnl`	On the Complexity of Ordered Colorings. SIAM J. Discret. Math. Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2008	J	`jnl`	Transversals of subtree hypergraphs and the source location problem in digraphs. Networks Jan van den Heuvel, Matthew Johnson
2007	J	`jnl`	A new upper bound on the cyclic chromatic number. J. Graph Theory Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel
2007	J	`jnl`	Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electron. Notes Discret. Math. Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2007	J	`jnl`	Frugal Colouring of Graphs CoRR Omid Amini, Louis Esperet, Jan van den Heuvel
2007	J	`jnl`	List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed
2007	B	`conf`	Mixing 3-Colourings in Bipartite Graphs. WG Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2006	J	`jnl`	A Linear Bound On The Diameter Of The Transportation Polytope. Comb. Graham R. Brightwell, Jan van den Heuvel, Leen Stougie
2006	—	`conf`	On the Complexity of Ordered Colourings. ACiD Jan van den Heuvel
2004	—	`conf`	The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN Jan van den Heuvel, Matthew Johnson
2003	J	`jnl`	Coloring the square of a planar graph. J. Graph Theory Jan van den Heuvel, Sean McGuinness
2002	J	`jnl`	Heavy cycles in weighted graphs. Discuss. Math. Graph Theory J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman
2001	J	`jnl`	Algorithmic Aspects Of A Chip-Firing Game. Comb. Probab. Comput. Jan van den Heuvel
2001	J	`jnl`	Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems. Ann. Oper. Res. Jan van den Heuvel, Snezana Pejic
1999	J	`jnl`	On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs. J. Comb. Theory B Jan van den Heuvel, Bill Jackson
1998	J	`jnl`	Graph labeling and radio channel assignment. J. Graph Theory Jan van den Heuvel, R. A. Leese, M. A. Shepherd
1997	J	`jnl`	Removable Circuits in Multigraphs. J. Comb. Theory B Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness
1997	J	`jnl`	The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
1996	J	`jnl`	2-factors in triangle-free graphs. J. Graph Theory Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
1996	J	`jnl`	Extensions and consequences of Chvátal-Erdős' theorem. Graphs Comb. Jan van den Heuvel
1996	J	`jnl`	Hamiltonicity of regular 2-connected graphs. J. Graph Theory Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman
1996	J	`jnl`	Long cycles in graphs with large degree sums and neighborhood unions. J. Graph Theory Jan van den Heuvel
1996	J	`jnl`	On graphs satisfying a local ore-type condition. J. Graph Theory Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1995	J	`jnl`	Degree sums, Graphs Comb. Ralph J. Faudree, Jan van den Heuvel
1995	J	`jnl`	Long cycles in graphs containing a 2-factor with many odd components. Discret. Math. Jan van den Heuvel
1995	J	`jnl`	Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1995	J	`jnl`	Pancyclicity of hamiltonian line graphs. Discret. Math. E. van Blanken, Jan van den Heuvel, Henk Jan Veldman
1995	J	`jnl`	Relative length of long paths and cycles in graphs with large degree sums. J. Graph Theory Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito
1995	J	`jnl`	Toughness and Triangle-Free Graphs. J. Comb. Theory B Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
1993	J	`jnl`	A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1993	J	`jnl`	Cycles containing all vertices of maximum degree. J. Graph Theory Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman
1993	J	`jnl`	Decomposition of bipartite graphs under degree constraints. Networks Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman
1993	J	`jnl`	Long cycles, degree sums and neighborhood unions. Discret. Math. Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1993	J	`jnl`	Long paths and cycles in tough graphs. Graphs Comb. Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman