Clemens, DennisDennisClemensTran, TuanTuanTran2020-03-252020-03-252016-04-27Discrete Mathematics 8 (339): 51-66 (2016)http://hdl.handle.net/11420/5484We consider biased (1:b) Walker-Breaker games: Walker and Breaker alternately claim edges of the complete graph Kn, Walker taking one edge and Breaker claiming b edges in each round, with the constraint that Walker needs to choose her edges according to a walk. As questioned in a paper by Espig, Frieze, Krivelevich and Pegden, we study how long a cycle Walker is able to create and for which biases b Walker has a chance to create a cycle of given constant length.en0012-365X2016821132126Elseviercycle gamepositional gamesthreshold biasWalker-Breakermathematics - combinatoricsMathematikJournal Article10.1016/j.disc.2016.03.007Other