Items where Author is "van den Heuvel, Jan"

Number of items: 33.
  • Algorithmic aspects of a chip-firing game. van den Heuvel, Jan
  • Best monotone degree conditions for graph properties: a survey. Bauer, D.; Broersma, H. J.; van den Heuvel, Jan; Kahl, N.; Nevo, A.; Schmeichel, E.; Woodall, D. R.; Yatauro, M.
  • Channel assignment on infinite sets under frequency-distance constraints. van den Heuvel, Jan; McDiarmid, Colin
  • Chromatic numbers of exact distance graphs. van den Heuvel, Jan; Kierstead, H. A; Quiroz, Daniel
  • Coloring the square of a planar graph. van den Heuvel, Jan; McGuinness, Sean
  • Connectedness of the graph of vertex-colourings. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Connectedness of the graph of vortex-colourings. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Cyclic orderings and cyclic arboricity of matroids. van den Heuvel, Jan; Thomassé, Stéphane
  • Cyclic orderings and cyclic arboricity of matroids. van den Heuvel, Jan; Thomassé, Stéphane
  • Degree sequences and the existence of k-Factors. Bauer, D.; Broersma, H. J.; van den Heuvel, Jan; Kahl, N.; Schmeichel, E.
  • Extension from precoloured sets of edges. Edwards, Katherine; Girão, António; van den Heuvel, Jan; Kang, Ross J.; Puleo, Gregory J.; Sereni, Jean-Sébastien
  • Extensions of fractional precolorings show discontinuous behavior. van den Heuvel, Jan; Král', Daniel; Kupec, Martin; Sereni, Jean-Sébastien; Volec, Jan
  • Finding paths between 3-colorings. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Finding paths between 3-colourings. Cereceda, L; van den Heuvel, Jan; Johnson, M
  • Fire containment in planar graphs. Esperet, Louis; van den Heuvel, Jan; Maffray, Frederic; Sipma, Felix
  • Heavy cycles in weighted graphs. Bondy, J. Adrian; Broersma, Hajo J.; van den Heuvel, Jan; Veldman, Henk Jan
  • Improper colourings inspired by Hadwiger’s conjecture. van den Heuvel, Jan; Wood, David R.
  • List colouring squares of planar graphs (extended abstract). van den Heuvel, Jan; Havet, F; McDiarmid, C; Reed, B
  • Mixing 3-colourings in bipartite graphs. Cereceda, L; van den Heuvel, Jan; Johnson, M
  • Mixing 3-colourings in bipartite graphs. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. van den Heuvel, Jan; Kreutzer, Stephan; Pilipczuk, Michal; Quiroz, Daniel; Rabinovich, Roman; Siebertz, Sebastian
  • On the complexity of ordered colorings. Gupta, Arvind; van den Heuvel, Jan; Manuch, Jan; Stacho, Ladislav; Zhao, Xiaohong
  • On the complexity of ordered colorings. Gupta, Arvind; van den Heuvel, Jan; Manuch, Jan; Stacho, Ladislav; Zhao, Xiaohong
  • On the generalised colouring numbers of graphs that exclude a fixed minor. van den Heuvel, Jan; Ossona de Mendez, Patrice; Quiroz, Daniel; Rabinovich, Roman; Siebertz, Sebastian
  • Radio channel assignment on 2-dimensional lattices. van den Heuvel, Jan
  • Transversals of subtree hypergraphs and the source location problem in digraphs. van den Heuvel, Jan; Johnson, Matthew
  • Transversals of subtree hypergraphs and the source location problem in digraphs. van den Heuvel, Jan; Johnson, Matthew
  • Using laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems. van den Heuvel, Jan; Pejić, Snežana
  • The external network problem with edge- or arc-connectivity requirements. van den Heuvel, Jan; Johnson, Matthew
  • The external network problem. van den Heuvel, Jan; Johnson, Matthew
  • A linear bound on the diameter of the transportation polytope. van den Heuvel, Jan; Brightwell, Graham; Stougie, Leen
  • A new upper bound on the cyclic chromatic number. Borodin, O. V.; Broersma, H. J.; Glebov, A.; van den Heuvel, Jan
  • A unified approach to distance-two colouring of graphs on surfaces. Amini, Omid; Esperet, Louis; van den Heuvel, Jan