The graph grabbing game on \(K_{m, n}\)-trees

DOI10.1016/j.disc.2018.02.023zbMath1384.05112OpenAlexW2794408178MaRDI QIDQ1744738

Yoshimi Egawa, Naoki Matsumoto, Hikoe Enomoto

Publication date: 19 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.02.023

zbMATH Keywords

bipartite graph\(K_{m, n}\)-treegraph grabbing game

Mathematics Subject Classification ID

Trees (05C05) 2-person games (91A05) Games involving graphs (91A43) Connectivity (05C40) Signed and weighted graphs (05C22) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

The graph grabbing game on \(\{0,1\}\)-weighted graphs ⋮ Convex grabbing game of the point set on the plane ⋮ Graph grabbing game on totally-weighted graphs

Cites Work

• Graph sharing games: complexity and connectivity
• Parity in graph sharing games
• Grabbing the gold
• How to eat 4/9 of a pizza
• A note on concurrent graph sharing games
• Solution of Peter Winkler’s Pizza Problem
• 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: The graph grabbing game on \(K_{m, n}\)-trees