On two problems regarding the Hamiltonian cycle game
From MaRDI portal
Publication:1010935
zbMATH Open1161.91011MaRDI QIDQ1010935FDOQ1010935
Authors: Dan Hefetz, S. 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (27)
- Title not available (Why is that?)
- On the WalkerMaker-WalkerBreaker games
- Creating cycles in walker-breaker games
- Building spanning trees quickly in maker-breaker games
- Biased games on random boards
- Fast embedding of spanning trees in biased maker-breaker games
- Sharp thresholds for half-random games. II
- Winning fast in biased maker-breaker games
- Hamiltonian games
- Fast strategies in Waiter-Client games
- A Hamiltonian game on \(K_{n,n}\)
- Global maker-breaker games on sparse graphs
- Winning fast in fair biased maker-breaker games
- Doubly biased walker-breaker games
- Hamiltonian maker-breaker games on small graphs
- Weak and strong \(k\)-connectivity games
- Complexity of maker-breaker games on edge sets of graphs
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Hitting time results for maker-breaker games
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
- The speed and threshold of the biased perfect matching and Hamilton cycle games
- Spanning Structures in Walker–Breaker Games
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
- A sharp threshold for the Hamilton cycle Maker–Breaker game
- How fast can maker win in fair biased games?
- On the Hamiltonicity of the \(k\)-regular graph game
- Solution of two problems of P. Erdős concerning Hamiltonian cycles
This page was built for publication: On two problems regarding the Hamiltonian cycle game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010935)
