4 citations · 7 across the 14 of their papers we have counts for
5 papers · 1 filter
On a recolouring version of Hadwiger's conjecture
Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne +1
We prove that for any , for any large enough , there is a graph that admits no -minor but admits a -colouring that is "frozen" wi…
Partizan Subtraction Games
Eric Duchêne, Marc Heinrich, Richard J. Nowakowski +1
Partizan subtraction games are combinatorial games where two players, say Left and Right, alternately remove a number n of tokens from a heap of tokens, with (resp. $n…
Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth
Marc Heinrich
The Glauber dynamics on the colourings of a graph is a random process which consists in recolouring at each step a random vertex of a graph with a new colour chosen uniformly at ra…
A generalization of Arc-Kayles
Antoine Dailly, Valentin Gledel, Marc Heinrich
The game Arc-Kayles is played on an undirected graph with two players taking turns deleting an edge and its endpoints from the graph. We study a generalization of this game, Weight…
A probabilistic Hadwiger-Nelson problem
Thomas Bourgeat, Marc Heinrich, Paul Melotti +1
If you color a table using k colors, and throw a needle randomly on it, for some proper definition, you get a certain probability that the endpoints will fall on different colors.…