On the Hamiltonicity of the k-regular graph game
Meza, Jeremy · Simon, Samuel
Original · EN
We consider a game played on an initially empty graph where two players alternate drawing an edge between vertices subject to the condition that no degree can exceed k. We show that for k=3, either player can avoid a Hamilton cycle, and for k≥4, either player can force the resulting graph to be Hamiltonian.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.