Pages that link to "Item:Q1010935"
From MaRDI portal
The following pages link to On two problems regarding the Hamiltonian cycle game (Q1010935):
Displaying 26 items.
- Creating cycles in walker-breaker games (Q284747) (← links)
- Winning fast in fair biased maker-breaker games (Q322263) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Solution of two problems of P. Erdős concerning Hamiltonian cycles (Q810050) (← links)
- Hamiltonian games (Q915667) (← links)
- Winning fast in biased maker-breaker games (Q1690027) (← links)
- On the Hamiltonicity of the \(k\)-regular graph game (Q1756080) (← links)
- A Hamiltonian game on \(K_{n,n}\) (Q1896354) (← links)
- Sharp thresholds for half-random games. II (Q2014222) (← links)
- On the WalkerMaker-WalkerBreaker games (Q2181217) (← links)
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- How fast can maker win in fair biased games? (Q2411594) (← links)
- Weak and strong \(k\)-connectivity games (Q2509746) (← links)
- The speed and threshold of the biased perfect matching and Hamilton cycle games (Q2696609) (← links)
- Hitting time results for maker-breaker games (Q2909241) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 (Q3074554) (← links)
- Hamiltonian Maker–Breaker Games on Small Graphs (Q3383707) (← links)
- A sharp threshold for the Hamilton cycle Maker–Breaker game (Q3608315) (← links)
- Spanning Structures in Walker–Breaker Games (Q5066070) (← links)
- Biased games on random boards (Q5265341) (← links)
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs (Q6098463) (← links)
- Doubly biased walker-breaker games (Q6621201) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)
