On the WalkerMaker - WalkerBreaker games
| dc.citation.epage | 18 | |
| dc.citation.spage | 1 | |
| dc.contributor.author | Forcan, Jovana | |
| dc.contributor.author | Mikalački, Mirjana | |
| dc.date.accessioned | 2023-10-19T12:32:06Z | |
| dc.date.available | 2023-10-19T12:32:06Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | We study the unbiased WalkerMaker-WalkerBreaker games on the edge set of the complete graph on n vertices, Kn, a variant of 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. | |
| dc.identifier.uri | https://vaseljena.ues.rs.ba/handle/123456789/853 | |
| dc.language.iso | en | |
| dc.source | arXiv | |
| dc.title | On the WalkerMaker - WalkerBreaker games | |
| dc.type | Article |
Датотеке
Оригинални завежљај
1 - 1 од 1
Учитавање...
- Име:
- On the WalkerMaker - WalkerBreaker games.pdf
- Величина:
- 353.84 KB
- Формат:
- Adobe Portable Document Format
- Опис:
Свежањ лиценце
1 - 1 од 1
Учитавање...
- Име:
- license.txt
- Величина:
- 1.71 KB
- Формат:
- Item-specific license agreed to upon submission
- Опис: