Parity in graph sharing games
From MaRDI portal
Publication:418883
DOI10.1016/J.DISC.2012.01.037zbMATH Open1242.05180OpenAlexW2152374136MaRDI QIDQ418883FDOQ418883
Authors: Piotr Micek, Bartosz Walczak 
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.037
Recommendations
- Parity games on undirected graphs
- Graph sharing games: complexity and connectivity
- Graph sharing games: complexity and connectivity
- A note on concurrent graph sharing games
- Computer Science Logic
- Parity Games on Graphs with Medium Tree-Width
- Clique-Width and Parity Games
- Parity games with partial information played on graphs of bounded complexity
- Games induced by the partitioning of a graph
- Graph operations on parity games and polynomial-time algorithms
Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)
Cites Work
Cited In (10)
- Graph sharing games: complexity and connectivity
- Grabbing the gold
- The graph grabbing game on \(K_{m, n}\)-trees
- How to eat 4/9 of a pizza
- A note on concurrent graph sharing games
- Playing weighted Tron on trees
- Parity Games on Graphs with Medium Tree-Width
- Convex grabbing game of the point set on the plane
- Graph grabbing game on totally-weighted graphs
- Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
This page was built for publication: Parity in graph sharing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418883)
