Publications of Jan van den Heuvel

Back to my my homepage.

Published and submitted articles; preprints

Other publications

Published and submitted articles; preprints

D. Bauer, H.J. Broersma, J. van den Heuvel, N. Kahl, and E. Schmeichel (2009),
Degree sequences and the existence of k-factors.
Submitted.
A preprint is available via arxiv.org/abs/0912.2916.
D. Bauer, H.J. Broersma, J. van den Heuvel, N. Kahl, and E. Schmeichel (2009),
Toughness and vertex degrees.
Submitted.
A preprint is available via arxiv.org/abs/0912.2919.
Luis Cereceda, Jan van den Heuvel, and Matthew Johnson (2009),
Mixing 3-colourings in bipartite graphs.
European Journal of Combinatorics 30, 1593-1606.
Link: dx.doi.org/10.1016/j.ejc.2009.03.011.
A preprint is available as CDAM Research Report CDAM-LSE-2007-06 (PDF).
Extended abstract in:
A. Brandstädt, D. Kratsch, and H. Müller (eds.), Graph-Theoretic Concepts in Computer Science, Proceedings of the 33rd International Workshop on Graph Drawing (WG 2007). Lecture Notes in Computer Science 4769 (2007), 166-177.
Link: dx.doi.org/10.1007/978-3-540-74839-7_17.
Jan van den Heuvel and Stéphan Thomassé (2009),
Cyclic orderings and cyclic arboricity of matroids.
Submitted.
A preprint is available via arxiv.org/abs/0912.2929.

Omid Amini, Louis Esperet, and Jan van den Heuvel (2008),
A unified approach to distance-two colouring of graphs on surfaces.
Submitted.
A preprint is available as CDAM Research Report CDAM-LSE-2008-23 (PDF).
Luis Cereceda, Jan van den Heuvel, and Matthew Johnson (2008),
Connectedness of the graph of vertex-colourings.
Discrete Mathematics 308, 913-919.
Link: dx.doi.org/10.1016/j.disc.2007.07.028.
A preprint is available as CDAM Research Report CDAM-LSE-2005-11 (PDF).
Arvind Gupta, Jan van den Heuvel, Ján Maňuch, Ladislav Stacho, and Xiaohong Zhao (2008),
On the complexity of ordered colorings.
SIAM Journal on Discrete Mathematics 22, 832-847.
Link: dx.doi.org/10.1137/060676222.
A preprint is available as CDAM Research Report CDAM-LSE-2006-16 (PDF).
Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, and Bruce Reed (2008),
List colouring squares of planar graphs.
Submitted.
A preprint is available as CDAM Research Report CDAM-LSE-2008-09 (PDF).
Extended abstract in:
Electronic Notes in Discrete Mathematics 29 (2007), 515-519.
Link: dx.doi.org/10.1016/j.endm.2007.07.079.
Jan van den Heuvel and Matthew Johnson (2008),
Transversals of subtree hypergraphs and the source location problem in digraphs.
Networks 51 (2008) 113-119.
Link: dx.doi.org/10.1002/net.20206.
A preprint is available as CDAM Research Report CDAM-LSE-2004-10 (PDF).

Omid Amini, Louis Esperet, and Jan van den Heuvel (2007),
Frugal colouring of graphs.
Submitted.
A preprint is available as CDAM Research Report CDAM-LSE-2007-11 (PDF).
Paul Bonsma, Luis Cereceda, Jan van den Heuvel, and Matthew Johnson (2007),
Finding paths between graph colourings: computational complexity and possible distances (extended abstract).
Electronic Notes in Discrete Mathematics 29, 463-469.
Link: dx.doi.org/10.1016/j.endm.2007.07.073.
O.V. Borodin, H.J. Broersma, A. Glebov, and J. van den Heuvel (2007),
A new upper bound on the cyclic chromatic number.
Journal of Graph Theory 54, 58-72.
Link: dx.doi.org/10.1002/jgt.20193.
A preprint is available as CDAM Research Report CDAM-LSE-2004-04 (PDF).
Luis Cereceda, Jan van den Heuvel, and Matthew Johnson (2007),
Finding paths between 3-colourings.
Accepted for publication in: Journal of Graph Theory.
A preprint is available as CDAM Research Report CDAM-LSE-2007-31 (PDF).

Graham Brightwell, Jan van den Heuvel, and Leen Stougie (2006),
A linear bound on the diameter of the transportation polytope.
Combinatorica 26, 133-139.
Link: dx.doi.org/10.1007/s00493-006-0010-5.
A preprint is available as CDAM Research Report CDAM-LSE-2003-10 (PDF).

Jan van den Heuvel and Matthew Johnson (2005),
The external network problem.
In: A. López-Ortiz and A. Hamel (eds.), Combinatorial and algorithmic aspects of networking. Selected papers from the 1st Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2004). Lecture Notes in Computer Science 3405, 114-126.
Link: dx.doi.org/10.1007/11527954_11.
A preprint is available as CDAM Research Report CDAM-LSE-2004-15 (PDF).

Jan van den Heuvel and Sean McGuinness (2003),
Coloring the square of a planar graph.
Journal of Graph Theory 42, 110-124.
Link: dx.doi.org/10.1002/jgt.10077.
A preprint is available as CDAM Research Report CDAM-LSE-99-06 (PDF).

J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, and Henk-Jan Veldman (2002),
Heavy cycles in weighted graphs.
Discussiones Mathematicae. Graph Theory 22, 7-15.
Link: www.discuss.wmie.uz.zgora.pl/gt/22_1/gt22bond.htm.
J. van den Heuvel (2002),
Radio channel assignment on 2-dimensional lattices.
Annals of Combinatorics 6, 463-477.
Link: www.springerlink.com/content/hueybqkhhpgjugwt/?p=16ecfb007d4545cda63a18505c574334&pi=17.
A preprint is available as CDAM Research Report CDAM-LSE-98-05 (PDF).

O.V. Borodin, H.J. Broersma, A. Glebov, and J. van den Heuvel (2001),
The structure of plane triangulations in terms of clusters and stars (in Russian),
Diskretnyi Analiz i Issledovanie Operatsii. Seriya 1 8, no. 2, 15-39.
The English version with title Stars and bunches in planar graphs. Part I: Triangulations is available as CDAM Research Report CDAM-LSE-2002-04 (PDF).
O.V. Borodin, H.J. Broersma, A. Glebov, and J. van den Heuvel (2001),
Minimal degrees and chromatic numbers of squares of planar graphs (in Russian),
Diskretnyi Analiz i Issledovanie Operatsii. Seriya 1 8, no. 4, 9-33.
The English version with title Stars and bunches in planar graphs. Part II: General planar graphs and colourings is available as CDAM Research Report CDAM-LSE-2002-05 (PDF).
Jan van den Heuvel (2001),
Algorithmic aspects of a chip-firing game.
Combinatorics, Probability and Computing 10, 505-529.
Link: dx.doi.org/10.1017/S0963548301004886.
A preprint is available as CDAM Research Report CDAM-LSE-99-09 (PDF).
Jan van den Heuvel and Snezana Pejic (2001),
Using Laplacian eigenvalues and eigenvectors in the analysis of Frequency Assignment Problems.
Annals of Operations Research 107, 349-368.
Link: dx.doi.org/10.1023/A:1014927805247.
A preprint is available as CDAM Research Report CDAM-LSE-2000-20 (PDF).

Jan van den Heuvel and Bill Jackson (1999),
On the edge connectivity, Hamiltonicity and toughness of vertex-transitive graphs.
Journal of Combinatorial Theory. Series B 77, 138-149.
Link: dx.doi.org/10.1006/jctb.1999.1917.

D. Bauer, J. van den Heuvel, A. Morgana, and E. Schmeichel (1998),
The complexity of toughness in regular graphs.
Congressus Numerantium 130, 47-61.
J. van den Heuvel, R.A. Leese, and M.A. Shepherd (1998),
Graph labelling and radio channel assignment.
Journal of Graph Theory 29, 263-283.
Link: dx.doi.org/10.1002/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V.

D. Bauer, J. van den Heuvel, A. Morgana, and E. Schmeichel (1997),
The complexity of recognizing tough cubic graphs.
Discrete Applied Mathematics 79, 35-44.
Link: dx.doi.org/10.1016/S0166-218X(97)00030-9.
Luis A. Goddyn, Jan van den Heuvel, and Sean McGuinness (1997),
Removable circuits in multigraphs.
Journal of Combinatorial Theory. Series B 71, 130-143.
Link: dx.doi.org/10.1006/jctb.1997.1775.

A.S. Asratian, H.J. Broersma, J. van den Heuvel, and H.J. Veldman (1996),
On graphs satisfying a local Ore-type condition.
Journal of Graph Theory 21, 1-10.
Link: dx.doi.org/10.1002/(SICI)1097-0118(199601)21:1<1::AID-JGT1>3.0.CO;2-W.
D. Bauer, J. van den Heuvel, and E. Schmeichel (1996),
2-Factors in tough triangle-free graphs.
Journal of Graph Theory 21, 405-412.
Link: dx.doi.org/10.1002/(SICI)1097-0118(199604)21:4<405::AID-JGT6>3.0.CO;2-T.
H.J. Broersma, J. van den Heuvel, B. Jackson, and H.J. Veldman (1996),
Hamiltonicity of regular 2-connected graphs.
Journal of Graph Theory 22, 105-124.
Link: dx.doi.org/10.1002/(SICI)1097-0118(199606)22:2<105::AID-JGT2>3.0.CO;2-R.
J. van den Heuvel (1996),
Extensions and Consequences of Chvátal-Erdös' theorem.
Graphs and Combinatorics 12, 231-237.
Link: dx.doi.org/10.1007/BF01858457.
J. van den Heuvel (1996),
Long cycles in graphs with large degree sums and neighborhood unions.
Journal of Graph Theory 21, 87-102.
Link: dx.doi.org/10.1002/(SICI)1097-0118(199601)21:1<87::AID-JGT12>3.0.CO;2-P.

Douglas Bauer, H.J. Broersma, J. van den Heuvel, and H.J. Veldman (1995),
Long cycles in graphs with prescribed toughness and minimum degree.
Discrete Mathematics 141, 1-10.
Link: dx.doi.org/10.1016/0012-365X(93)E0204-H.
D. Bauer, J. van den Heuvel, and E. Schmeichel (1995),
Toughness and triangle-free graphs.
Journal of Combinatorial Theory. Series B 65, 208-221.
Link: dx.doi.org/10.1006/jctb.1995.1051.
E. van Blanken, J. van den Heuvel, and H.J. Veldman (1995),
Pancyclicity of hamiltonian line graphs.
Discrete Mathematics 138, 379-385.
Link: dx.doi.org/10.1016/0012-365X(94)00220-D.
Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, and Akira Saito (1995),
Relative length of long paths and cycles in graphs with large degree sums.
Journal of Graph Theory 20, 213-225.
Link: dx.doi.org/10.1002/jgt.3190200210.
R.J. Faudree and J. van den Heuvel (1995),
Degree sums, k-factors and Hamilton cycles in graphs.
Graphs and Combinatorics 11, 21-28.
Link: www.springerlink.com/content/g632qn7l445x2x41/?p=0392237e1ad04bd3a69eea3e4b8fca07&pi=1.
J. van den Heuvel (1995),
Hamilton cycles and eigenvalus of graphs.
Linear Algebra and its Applications 226/228, 723-730.
Link: dx.doi.org/10.1016/0024-3795(95)00254-O.
J. van den Heuvel (1995),
Long cycles in graphs containing a 2-factor with many odd components.
Discrete Mathematics 137, 389-393.
Link: dx.doi.org/10.1016/0012-365X(93)E0118-N.

D. Bauer, H.J. Broersma, J. van den Heuvel, and H.J. Veldman (1994),
On Hamiltonian properties of 2-tough graphs.
Journal of Graph Theory 18, 539-543.
Link: www3.interscience.wiley.com/journal/113453376/issue.

H.J. Broersma, R.J. Faudree, J. van den Heuvel, and H.J. Veldman (1993),
Decomposition of bipartite graphs under degree constraints.
Networks 23, 159-164.
Link: dx.doi.org/10.1002/net.3230230303.
H.J. Broersma, J. van den Heuvel, H.A. Jung, and H.J. Veldman (1993),
Cycles containing all vertices of maximum degree.
Journal of Graph Theory 17, 373-385.
Link: dx.doi.org/10.1002/jgt.3190170311.
H.J. Broersma, J. van den Heuvel, H.A. Jung, and H.J. Veldman (1993),
Long paths and cycles in tough graphs.
Graphs and Combinatorics 9, 3-17.
Link: www.springerlink.com/content/u13g17710702t753/?p=15f623920b4043f3ba207ee42be3cb0d&pi=1.
H.J. Broersma, J. van den Heuvel, and H.J. Veldman (1993),
A generalization of Ore's theorem involving neighborhood unions.
Discrete Mathematics 122, 37-49.
Link: dx.doi.org/10.1016/0012-365X(93)90285-2.
H.J. Broersma, J. van den Heuvel, and H.J. Veldman (1993),
Long cycles, degree sums and neighborhood unions.
Discrete Mathematics 121, 25-35.
Link: dx.doi.org/10.1016/0012-365X(93)90534-Z.

Other publications

J. van den Heuvel and C. McDiarmid (2002),
Channel assignment on infinite sets under frequency-distance constraints.
In: R. Leese and S. Hurley (eds.), Methods and Algorithms for Radio Channel Assignment (Oxford University Press).
A preprint is available as CDAM Research Report CDAM-LSE-2001-10 (PDF).
Jan van den Heuvel (2000),
All things with some omissions (review of Discrete Mathematics by S. Washburn, T. Marlowe, and C.T. Ryan);
Times Higher Education Supplement, November 2000.
Jan van den Heuvel (2000),
Discrete invitations (review of Discrete Mathematics: Numbers and Beyond by S. Barnett, and Invitation to Discrete Mathematics by J. Matousek and J. Nesetril);
Times Higher Education Supplement, March 2000.
J. van den Heuvel and S. McGuinness (1998),
Colouring and labelling of planar graphs.
In: J.M. Janiszewski, W. Moron, and W. Sega, (eds.), Proceedings of the Fourteenth International Wroclaw Symposium and Exhibition on Electromagnetic Compatibility, June 23-25, 1998 (Institute of Telecommunications).
Jan van den Heuvel (1993),
Degree and Toughness Conditions for Cycles in Graphs.
Ph.D. Thesis, University of Twente, Enschede, the Netherlands.
ISBN 90-9006283-1.
To obtain a copy, please send email to the author at jan@maths.lse.ac.uk.
Jan van den Heuvel (1989),
Structures in Association Schemes.
Master's Thesis, University of Technology, Eindhoven, the Netherlands.

Back to my my homepage.

Last modified: Thu Mar 25 17:35:56 GMT 2010
Send comments to webmaster