J. van den Heuvel

collaborators

3 papers

math.CO2025

2-Factors in Graphs

Jan van den Heuvel, Bjarne Toft

An account of 2-factors in graphs and their history is presented. We give a direct graph-theoretic proof of the 2-Factor Theorem and a new variant of it, and also a new complete ch…

math.CO2025

Determining a graph from its reconfiguration graph

Gaétan Berthe, Caroline Brosse, Brian Hearn +3

Given a graph $G$ and a natural number $k$ , the $k$ -recolouring graph $C_{k} (G)$ is the graph whose vertices are the $k$ -colourings of $G$ and whose edges link pairs of col…

math.CO2024

Multi-Colouring of Kneser Graphs: Notes on Stahl's Conjecture

Jan van den Heuvel, Xinyi Xu

A (finite, undirected) graph is $(n, k)$ -colourable if we can assign each vertex a $k$ -subset of ${1, 2, \dots, n}$ so that adjacent vertices receive disjoint subsets. We consider t…