Walker-Breaker games
classification
🧮 math.CO
keywords
gamesgraphwalker-breakeranalyzechooseconstrainededgesgame
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.