Walker-breaker games

From MaRDI portal
Publication:2944455

DOI10.1137/140953708zbMATH Open1320.05084arXiv1401.5538OpenAlexW2949871980WikidataQ57401415 ScholiaQ57401415MaRDI QIDQ2944455FDOQ2944455


Authors: Lisa Espig, Michael Krivelevich, Wesley Pegden, Alan Frieze Edit this on Wikidata


Publication date: 2 September 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1401.5538




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Walker-breaker games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944455)