Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14146
Title: | On the WalkerMaker–WalkerBreaker games | Authors: | Forcan J. Mikalački, Milena |
Issue Date: | 1-Jan-2019 | Journal: | Discrete Applied Mathematics | Abstract: | © 2019 Elsevier B.V. We study the unbiased WalkerMaker–WalkerBreaker games on the edge set of the complete graph on n vertices, Kn, a variant of the well-known Maker–Breaker positional games, where both players have the restriction on the way of playing. Namely, each player has to choose her/his edges according to a walk. Here, we focus on two standard graph games — the Connectivity game and the Hamilton cycle game and show how quickly WalkerMaker can win both games. | URI: | https://open.uns.ac.rs/handle/123456789/14146 | ISSN: | 0166218X | DOI: | 10.1016/j.dam.2019.10.003 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
4
checked on Nov 20, 2023
Page view(s)
38
Last Week
20
20
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.