Maker–Breaker Games with Constraints
| dc.citation.epage | 667 | |
| dc.citation.spage | 663 | |
| dc.contributor.author | Forcan, Jovana | |
| dc.contributor.author | Mikalački, Mirjana | |
| dc.date.accessioned | 2023-10-19T11:58:51Z | |
| dc.date.available | 2023-10-19T11:58:51Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | We analyse the unbiased WalkerMaker–WalkerBreaker game, a variant of the well-known Maker–Breaker positional game where both players Maker and Breaker are constrained to choose their edges according to a walk. Here, we consider two standard graph games - the Connectivity game and the Hamilton Cycle game played on the edge set of the complete graph, Kn, on n vertices, and show how fast Walker-Maker can build desired spanning structures in these games. | |
| dc.identifier.doi | 10.1007/978-3-030-83823-2 | |
| dc.identifier.uri | https://vaseljena.ues.rs.ba/handle/123456789/851 | |
| dc.language.iso | en | |
| dc.source | Extended Abstracts EuroComb 2021 | |
| dc.subject | Positional games, Maker–Breaker games, Spanning tree, Hamilton cycle | |
| dc.title | Maker–Breaker Games with Constraints | |
| dc.type | Article |
Датотеке
Оригинални завежљај
1 - 1 од 1
Учитавање...
- Име:
- Maker–Breaker Games with Constraints.pdf
- Величина:
- 23.15 MB
- Формат:
- Adobe Portable Document Format
- Опис:
Свежањ лиценце
1 - 1 од 1
Учитавање...
- Име:
- license.txt
- Величина:
- 1.71 KB
- Формат:
- Item-specific license agreed to upon submission
- Опис: