Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
From MaRDI portal
Publication:5272631
DOI10.1002/jgt.22045zbMath1365.05197arXiv1411.6727OpenAlexW1689859238MaRDI QIDQ5272631
Adam Gągol, Piotr Micek, Bartosz Walczak
Publication date: 30 June 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6727
Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Graph sharing games: complexity and connectivity ⋮ Parity in graph sharing games ⋮ The graph grabbing game on \(K_{m, n}\)-trees ⋮ Graph grabbing game on totally-weighted graphs
Cites Work
- Graph sharing games: complexity and connectivity
- Parity in graph sharing games
- Grabbing the gold
- On forbidden subdivision characterizations of graph classes
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- How to eat 4/9 of a pizza
- Graphs with linearly bounded Ramsey numbers
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Topological cliques in graphs II
- A Graph-Grabbing Game
- Short proof of Menger's graph theorem
- Zusammenzüge und Unterteilungen von Graphen
