Weak and strong \(k\)-connectivity games

DOI10.1016/j.ejc.2013.06.015zbMath1296.05129arXiv1203.3447OpenAlexW1993198489MaRDI QIDQ2509746

Asaf Ferber, Dan Hefetz

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.3447

zbMATH Keywords

perfect matchingHamilton cyclemaker-breaker games\(k\)-connected graph

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Generalized Ramsey theory (05C55) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (15)

Creating cycles in walker-breaker games ⋮ Winning fast in fair biased maker-breaker games ⋮ Generating random graphs in biased Maker-Breaker games ⋮ Strong Ramsey games: drawing on an infinite board ⋮ How fast can maker win in fair biased games? ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Random-player maker-breaker games ⋮ Winning fast in biased maker-breaker games ⋮ Fast strategies in Waiter-Client games ⋮ Strong Ramsey games in unbounded time ⋮ Strong games played on random graphs ⋮ Sharp thresholds for half-random games. II ⋮ Biased games on random boards ⋮ On strong avoiding games ⋮ Efficient Winning Strategies in Random‐Turn Maker–Breaker Games

Cites Work

• Fast embedding of spanning trees in biased maker-breaker games
• Winning strong games through fast strategies for weak games
• On the clique-game
• On two problems regarding the Hamiltonian cycle game
• Ramsey games
• Fast winning strategies in maker-breaker games
• Combinatorial Games
• A Solution of the Shannon Switching Game

This page was built for publication: Weak and strong \(k\)-connectivity games