On two problems regarding the Hamiltonian cycle game

zbMath1161.91011MaRDI QIDQ1010935

Dan Hefetz, Sebastian U. Stich

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129913

Mathematics Subject Classification ID

Combinatorial games (91A46) Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

Creating cycles in walker-breaker games ⋮ Hitting time results for Maker-Breaker games ⋮ Winning fast in fair biased maker-breaker games ⋮ Spanning Structures in Walker–Breaker Games ⋮ How fast can maker win in fair biased games? ⋮ On the WalkerMaker-WalkerBreaker games ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Global maker-breaker games on sparse graphs ⋮ Winning fast in biased maker-breaker games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Fast strategies in Waiter-Client games ⋮ Fast embedding of spanning trees in biased maker-breaker games ⋮ The speed and threshold of the biased perfect matching and Hamilton cycle games ⋮ Sharp thresholds for half-random games. II ⋮ Weak and strong \(k\)-connectivity games ⋮ The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 ⋮ Hamiltonian Maker–Breaker Games on Small Graphs ⋮ Biased games on random boards

This page was built for publication: On two problems regarding the Hamiltonian cycle game