论文信息 - Walker-Breaker Games

Walker-Breaker Games

We introduce and analyze the Walker-Breaker game, a variant of Maker-Breaker games where Maker is constrained to choose edges of a walk or path in a given graph G, with the goal of visiting as many vertices of the underlying graph as possible.

[1] L. H. Harper. Optimal numberings and isoperimetric problems on graphs , 1966 .

[2] Paul Erdös,et al. On a Combinatorial Game , 1973, J. Comb. Theory A.

[3] P. Erdös,et al. Biased Positional Games , 1978 .

[4] Yahya Ould Hamidoune,et al. A solution to the Box Game , 1987, Discret. Math..

[5] Peter Winkler,et al. Maximum itting Time for Random Walks on Graphs , 1990, Random Struct. Algorithms.

[6] Devdatt P. Dubhashi,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.

[7] J. Beck. Combinatorial Games: Tic-Tac-Toe Theory , 2008 .

[8] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .

[9] Michael Krivelevich,et al. Fast winning strategies in Maker-Breaker games , 2009, J. Comb. Theory, Ser. B.