05988768

a

05988768 Bodlaender, Marijke H.L. Hurkens, Cor A.J. Woeginger, Gerhard J. The cinderella game on holes and anti-holes. Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Tepl\'a Monastery, Czech Republic, June 21--24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 71-82 (2011). 2011 Berlin: Springer EN Combinatorial game on-line algorithms perfect graphs

doi:10.1007/978-3-642-25870-1_8

Summary: We investigate a two-player game on graphs, where one player (Cinderella) wants to keep the behavior of an underlying water-bucket system stable whereas the other player (the wicked Stepmother) wants to cause overflows. The bucket number of a graph $G$ is the smallest possible bucket size with which Cinderella can win the game. We determine the bucket numbers of all perfect graphs, and we also derive results on the bucket numbers of certain non-perfect graphs. In particular, we analyze the game on holes and (partially) on anti-holes for the cases where Cinderella sticks to a simple greedy strategy.