2 papers
math.CO2025
On a conjecture of Faudree and Schelp
Jan Goedgebeur, Jorik Jooken, Michiel Provoost +1
In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on vertices, any two distinct vertices are connected by a path of length for every .…
math.CO2025
On edge-colouring-games by Erdős, and Bensmail and Mc Inerney
Stijn Cambie, Michiel Provoost
We study two games proposed by Erdős, and one game by Bensmail and Mc Inerney, all sharing a common setup: two players alternately colour edges of a complete graph, or in the biase…