Department of Mathematics, London School of Economics and Political Science, London, UK
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j33 |      | Douglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel: Toughness and Vertex Degrees. Journal of Graph Theory 72(2): 209-219 (2013) |
| 2012 | ||
| j32 | | Douglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel: Degree Sequences and the Existence of k-Factors. Graphs and Combinatorics 28(2): 149-166 (2012) |
| j31 | | Jan van den Heuvel, Stéphan Thomassé: Cyclic orderings and cyclic arboricity of matroids. J. Comb. Theory, Ser. B 102(3): 638-646 (2012) |
| 2011 | ||
| j30 | | Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Finding paths between 3-colorings. Journal of Graph Theory 67(1): 69-82 (2011) |
| 2010 | ||
| j29 | | Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich: Preface. Discrete Mathematics 310(2): 197-198 (2010) |
| 2009 | ||
| j28 | | 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 | ||
| j27 | | Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Connectedness of the graph of vertex-colourings. Discrete Mathematics 308(5-6): 913-919 (2008) |
| j26 | | Jan van den Heuvel, Matthew Johnson: Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51(2): 113-119 (2008) |
| j25 | | Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: On the Complexity of Ordered Colorings. SIAM J. Discrete 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 | ||
| j24 | | Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electronic Notes in Discrete Mathematics 29: 463-469 (2007) |
| j23 | | Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed: List Colouring Squares of Planar Graphs. Electronic Notes in Discrete Mathematics 29: 515-519 (2007) |
| j22 | | Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel: A new upper bound on the cyclic chromatic number. Journal of 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 | ||
| j21 | | Graham Brightwell, Jan van den Heuvel, Leen Stougie: A Linear Bound On The Diameter Of The Transportation Polytope. Combinatorica 26(2): 133-139 (2006) |
| c2 | | |
| 2004 | ||
| c1 | | Jan van den Heuvel, Matthew Johnson: The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN 2004: 114-126 |
| 2003 | ||
| j20 | | Jan van den Heuvel, Sean McGuinness: Coloring the square of a planar graph. Journal of Graph Theory 42(2): 110-124 (2003) |
| 2002 | ||
| j19 | | John Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman: Heavy cycles in weighted graphs. Discussiones Mathematicae Graph Theory 22(1): 7-15 (2002) |
| 2001 | ||
| j18 | | Jan van den Heuvel, Snezana Pejic: Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems. Annals OR 107(1-4): 349-368 (2001) |
| j17 | | Jan van den Heuvel: Algorithmic Aspects Of A Chip-Firing Game. Combinatorics, Probability & Computing 10(6): 505-529 (2001) |
| 1998 | ||
| j16 | | Jan van den Heuvel, R. A. Leese, M. A. Shepherd: Graph labeling and radio channel assignment. Journal of Graph Theory 29(4): 263-283 (1998) |
| 1997 | ||
| j15 | | Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel: The Complexity of Recognizing Tough Cubic Graphs. Discrete Applied Mathematics 79(1-3): 35-44 (1997) |
| j14 | | Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness: Removable Circuits in Multigraphs. J. Comb. Theory, Ser. B 71(2): 130-143 (1997) |
| 1996 | ||
| j13 | | Jan van den Heuvel: Extensions and consequences of Chvátal-Erdős' theorem. Graphs and Combinatorics 12(1): 231-237 (1996) |
| j12 | | Armen S. Asratian, H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: On graphs satisfying a local ore-type condition. Journal of Graph Theory 21(1): 1-10 (1996) |
| j11 | | Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel: 2-factors in triangle-free graphs. Journal of Graph Theory 21(4): 405-412 (1996) |
| j10 | | H. J. Broersma, Jan van den Heuvel, B. Jackson, Henk Jan Veldman: Hamiltonicity of regular 2-connected graphs. Journal of Graph Theory 22(2): 105-124 (1996) |
| 1995 | ||
| j9 | | Jan van den Heuvel: Long cycles in graphs containing a 2-factor with many odd components. Discrete Mathematics 137(1-3): 389-393 (1995) |
| j8 | | E. van Blanken, Jan van den Heuvel, Henk Jan Veldman: Pancyclicity of hamiltonian line graphs. Discrete Mathematics 138(1-3): 379-385 (1995) |
| j7 | | Douglas Bauer, H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics 141(1-3): 1-10 (1995) |
| j6 | | Ralph J. Faudree, Jan van den Heuvel: Degree sums, k-factors and hamilton cycles in graphs. Graphs and Combinatorics 11(1): 21-28 (1995) |
| j5 | | Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel: Toughness and Triangle-Free Graphs. J. Comb. Theory, Ser. B 65(2): 208-221 (1995) |
| j4 | | Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito: Relative length of long paths and cycles in graphs with large degree sums. Journal of Graph Theory 20(2): 213-225 (1995) |
| 1993 | ||
| j3 | | H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: Long cycles, degree sums and neighborhood unions. Discrete Mathematics 121(1-3): 25-35 (1993) |
| j2 | | H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: A generalization of Ore's Theorem involving neighborhood unions. Discrete Mathematics 122(1-3): 37-49 (1993) |
| j1 | | H. J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman: Long paths and cycles in tough graphs. Graphs and Combinatorics 9(1): 3-17 (1993) |
Colors in the list of coauthors
Last update Sun May 19 15:29:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page