|Publisher DOI:||10.1016/j.disc.2016.03.007||Title:||Creating cycles in Walker-Breaker games||Language:||English||Authors:||Clemens, Dennis
|Keywords:||cycle game;positional games;threshold bias;Walker-Breaker;mathematics - combinatorics||Issue Date:||27-Apr-2016||Publisher:||Elsevier||Source:||Discrete Mathematics 8 (339): 51-66 (2016)||Abstract (english):||
We 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.
|URI:||http://hdl.handle.net/11420/5484||ISSN:||0012-365X||Institute:||Mathematik E-10||Document Type:||Article||Journal:||Discrete mathematics|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Jun 27, 2022
checked on Jun 21, 2022
Add Files to Item
Note about this record
Cite this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.