The graph grabbing game on blow-ups of trees and cycles
From MaRDI portal
Publication:6345679
arXiv2007.11805MaRDI QIDQ6345679FDOQ6345679
Teeradej Kittipassorn, Sopon Boriboon
Publication date: 23 July 2020
Abstract: The graph grabbing game is played on a non-negatively weighted connected graph by Alice and Bob who alternately claim a non-cut vertex from the remaining graph, where Alice plays first, to maximize the weights on their respective claimed vertices at the end of the game when all vertices have been claimed. Seacrest and Seacrest conjectured that Alice can secure at least half of the weight of every weighted connected bipartite even graph. Later, Egawa, Enomoto and Matsumoto partially confirmed this conjecture by showing that Alice wins the game on a class of weighted connected bipartite even graphs called -trees. We extend the result on this class to include a number of graphs, e.g. even blow-ups of trees and cycles.
This page was built for publication: The graph grabbing game on blow-ups of trees and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345679)
