Graph sharing games: complexity and connectivity

DOI10.1016/j.tcs.2012.12.029zbMath1295.91020OpenAlexW2163503431MaRDI QIDQ391088

Viola Mészáros, Jan Kynčl, Rudolf Stolař, Pavel Valtr, Josef Cibulka

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.029

zbMATH Keywords

\(k\)-connected graphgraph sharing gamePSPACE-complete problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43)

Related Items (7)

Parity in graph sharing games ⋮ The graph grabbing game on \(K_{m, n}\)-trees ⋮ Playing weighted Tron on trees ⋮ Convex grabbing game of the point set on the plane ⋮ Graph grabbing game on totally-weighted graphs ⋮ Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph ⋮ Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision

Cites Work

• Parity in graph sharing games
• Grabbing the gold
• Characterisations and examples of graph classes with bounded expansion
• How to eat 4/9 of a pizza
• Structural Properties of Sparse Graphs
• A Graph-Grabbing Game
• Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
• Unnamed Item

This page was built for publication: Graph sharing games: complexity and connectivity