default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan van den Heuvel
Person information
- affiliation: Department of Mathematics, London School of Economics and Political Science, London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j48]Jan van den Heuvel, Henry A. Kierstead:
Uniform orderings for generalized coloring numbers. Eur. J. Comb. 91: 103214 (2021)- 2020
- [j47]Kord Eickmeyer
, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020)
2010 – 2019
- 2019
- [j46]Jan van den Heuvel, Hal A. Kierstead, Daniel A. Quiroz:
Chromatic numbers of exact distance graphs. J. Comb. Theory B 134: 143-163 (2019) - [i6]Jan van den Heuvel, Hal A. Kierstead:
Uniform Orderings for Generalized Coloring Numbers. CoRR abs/1907.12149 (2019) - 2018
- [j45]Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni:
Extension from Precoloured Sets of Edges. Electron. J. Comb. 25(3): 3 (2018) - [j44]Jan van den Heuvel, David R. Wood:
Improper colourings inspired by Hadwiger's conjecture. J. Lond. Math. Soc. 98(1): 129-148 (2018) - [i5]Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. CoRR abs/1812.08003 (2018) - 2017
- [j43]Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz:
On the generalised colouring numbers of graphs that exclude a fixed minor. Eur. J. Comb. 66: 129-144 (2017) - [c6]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS 2017: 1-11 - [i4]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion. CoRR abs/1701.08516 (2017) - 2016
- [i3]Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz:
On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor. CoRR abs/1602.09052 (2016) - 2015
- [j42]Jan van den Heuvel, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
On the generalised colouring numbers of graphs that exclude a fixed minor. Electron. Notes Discret. Math. 49: 523-530 (2015) - [j41]Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31(1): 1-22 (2015) - 2014
- [j40]Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec:
Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory 77(4): 299-329 (2014) - 2013
- [j39]Omid Amini, Louis Esperet, Jan van den Heuvel:
A unified approach to distance-two colouring of graphs on surfaces. Comb. 33(3): 253-296 (2013) - [j38]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Toughness and Vertex Degrees. J. Graph Theory 72(2): 209-219 (2013) - [j37]Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma:
Fire Containment in Planar Graphs. J. Graph Theory 73(3): 267-279 (2013) - [p1]Jan van den Heuvel:
The complexity of change. Surveys in Combinatorics 2013: 127-160 - [i2]Jan van den Heuvel:
The Complexity of Change. CoRR abs/1312.2816 (2013) - 2012
- [j36]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Degree Sequences and the Existence of k-Factors. Graphs Comb. 28(2): 149-166 (2012) - [j35]Jan van den Heuvel, Stéphan Thomassé:
Cyclic orderings and cyclic arboricity of matroids. J. Comb. Theory B 102(3): 638-646 (2012) - 2011
- [j34]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding paths between 3-colorings. J. Graph Theory 67(1): 69-82 (2011) - 2010
- [j33]Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich:
Preface. Discret. Math. 310(2): 197-198 (2010)
2000 – 2009
- 2009
- [j32]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30(7): 1593-1606 (2009) - [c5]Omid Amini, Louis Esperet, Jan van den Heuvel:
A unified approach to distance-two colouring of planar graphs. SODA 2009: 273-282 - 2008
- [j31]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Connectedness of the graph of vertex-colourings. Discret. Math. 308(5-6): 913-919 (2008) - [j30]Jan van den Heuvel, Matthew Johnson:
Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51(2): 113-119 (2008) - [j29]Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
On the Complexity of Ordered Colorings. SIAM J. Discret. Math. 22(2): 832-847 (2008) - [c4]Matthew Johnson, Luis Cereceda, Jan van den Heuvel:
Finding Paths Between 3-Colourings. IWOCA 2008: 182-196 - 2007
- [j28]Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electron. Notes Discret. Math. 29: 463-469 (2007) - [j27]Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed:
List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. 29: 515-519 (2007) - [j26]Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel:
A new upper bound on the cyclic chromatic number. J. Graph Theory 54(1): 58-72 (2007) - [c3]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-Colourings in Bipartite Graphs. WG 2007: 166-177 - [i1]Omid Amini, Louis Esperet, Jan van den Heuvel:
Frugal Colouring of Graphs. CoRR abs/0705.0422 (2007) - 2006
- [j25]Graham R. Brightwell, Jan van den Heuvel, Leen Stougie:
A Linear Bound On The Diameter Of The Transportation Polytope. Comb. 26(2): 133-139 (2006) - [c2]Jan van den Heuvel:
On the Complexity of Ordered Colourings. ACiD 2006: 156 - 2004
- [c1]Jan van den Heuvel, Matthew Johnson:
The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN 2004: 114-126 - 2003
- [j24]Jan van den Heuvel, Sean McGuinness:
Coloring the square of a planar graph. J. Graph Theory 42(2): 110-124 (2003) - 2002
- [j23]J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman:
Heavy cycles in weighted graphs. Discuss. Math. Graph Theory 22(1): 7-15 (2002) - 2001
- [j22]Jan van den Heuvel, Snezana Pejic:
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems. Ann. Oper. Res. 107(1-4): 349-368 (2001) - [j21]Jan van den Heuvel:
Algorithmic Aspects Of A Chip-Firing Game. Comb. Probab. Comput. 10(6): 505-529 (2001)
1990 – 1999
- 1999
- [j20]Jan van den Heuvel, Bill Jackson:
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs. J. Comb. Theory B 77(1): 138-149 (1999) - 1998
- [j19]Jan van den Heuvel, R. A. Leese, M. A. Shepherd:
Graph labeling and radio channel assignment. J. Graph Theory 29(4): 263-283 (1998) - 1997
- [j18]Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel:
The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. 79(1-3): 35-44 (1997) - [j17]Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness:
Removable Circuits in Multigraphs. J. Comb. Theory B 71(2): 130-143 (1997) - 1996
- [j16]Jan van den Heuvel:
Extensions and consequences of Chvátal-Erdős' theorem. Graphs Comb. 12(1): 231-237 (1996) - [j15]Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
On graphs satisfying a local ore-type condition. J. Graph Theory 21(1): 1-10 (1996) - [j14]Jan van den Heuvel:
Long cycles in graphs with large degree sums and neighborhood unions. J. Graph Theory 21(1): 87-102 (1996) - [j13]Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel:
2-factors in triangle-free graphs. J. Graph Theory 21(4): 405-412 (1996) - [j12]Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman:
Hamiltonicity of regular 2-connected graphs. J. Graph Theory 22(2): 105-124 (1996) - 1995
- [j11]Jan van den Heuvel:
Long cycles in graphs containing a 2-factor with many odd components. Discret. Math. 137(1-3): 389-393 (1995) - [j10]E. van Blanken, Jan van den Heuvel, Henk Jan Veldman:
Pancyclicity of hamiltonian line graphs. Discret. Math. 138(1-3): 379-385 (1995) - [j9]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. 141(1-3): 1-10 (1995) - [j8]Ralph J. Faudree, Jan van den Heuvel:
Degree sums, k-factors and hamilton cycles in graphs. Graphs Comb. 11(1): 21-28 (1995) - [j7]Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel:
Toughness and Triangle-Free Graphs. J. Comb. Theory B 65(2): 208-221 (1995) - [j6]Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito:
Relative length of long paths and cycles in graphs with large degree sums. J. Graph Theory 20(2): 213-225 (1995) - 1993
- [j5]Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
Long cycles, degree sums and neighborhood unions. Discret. Math. 121(1-3): 25-35 (1993) - [j4]Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. 122(1-3): 37-49 (1993) - [j3]Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Long paths and cycles in tough graphs. Graphs Comb. 9(1): 3-17 (1993) - [j2]Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Cycles containing all vertices of maximum degree. J. Graph Theory 17(3): 373-385 (1993) - [j1]Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman:
Decomposition of bipartite graphs under degree constraints. Networks 23(3): 159-164 (1993)
Coauthor Index
aka: Haitze J. Broersma
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
