Planarity, Colorability, and Minor Games
From MaRDI portal
Publication:3614201
DOI10.1137/060654414zbMath1167.91010OpenAlexW2042425780MaRDI QIDQ3614201
Dan Hefetz, Michael Krivelevich, Tibor Szabó, Miloš Stojaković
Publication date: 16 March 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060654414
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Combinatorial games (91A46)
Related Items (22)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Fast winning strategies in avoider-enforcer games ⋮ Maker-Breaker total domination game on cubic graphs ⋮ Sharp thresholds for half-random games I ⋮ Avoider-forcer games on hypergraphs with small rank ⋮ Fast winning strategies in positional games ⋮ Multistage positional games ⋮ On the odd cycle game and connected rules ⋮ The Random Graph Intuition for the Tournament Game ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ On the clique-game ⋮ Game matching number of graphs ⋮ Avoider-enforcer: the rules of the game ⋮ Keeping avoider's graph almost acyclic ⋮ The picker-chooser diameter game ⋮ Playing to Retain the Advantage ⋮ The diameter game ⋮ Fast winning strategies in maker-breaker games ⋮ On the separation conjecture in avoider-enforcer games ⋮ The toucher-isolator game ⋮ Avoider-Enforcer: The Rules of the Game ⋮ The Game Saturation Number of a Graph
This page was built for publication: Planarity, Colorability, and Minor Games
