On two problems regarding the Hamiltonian cycle game

MaRDI QIDQ1010935zbMATH OpenFDO

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, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r28.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian maker-breaker games on small graphs
• Fast winning strategies in maker-breaker games
• Hamiltonian games
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• A Hamiltonian game on \(K_{n,n}\)

Cited in

(27)

• Hamiltonian maker-breaker games on small graphs
• Doubly biased walker-breaker games
• On the WalkerMaker-WalkerBreaker games
• Spanning Structures in Walker–Breaker Games
• Weak and strong \(k\)-connectivity games
• Complexity of maker-breaker games on edge sets of graphs
• How fast can maker win in fair biased games?
• \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
• Fast embedding of spanning trees in biased maker-breaker games
• Creating cycles in walker-breaker games
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• Global maker-breaker games on sparse graphs
• Building spanning trees quickly in maker-breaker games
• On the Hamiltonicity of the \(k\)-regular graph game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Biased games on random boards
• Hitting time results for maker-breaker games
• Sharp thresholds for half-random games. II
• Winning fast in fair biased maker-breaker games
• scientific article; zbMATH DE number 4006014 (Why is no real title available?)
• Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
• Winning fast in biased maker-breaker games
• Fast strategies in Waiter-Client games
• Hamiltonian games
• Solution of two problems of P. Erdős concerning Hamiltonian cycles
• The speed and threshold of the biased perfect matching and Hamilton cycle games
• A Hamiltonian game on \(K_{n,n}\)

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)