Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2016
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914477515997184 |
|---|---|
| author | Beaudou, Laurent Coupechoux, Pierre Dailly, Antoine Gravier, Sylvain Moncel, Julien Parreau, Aline Sopena, Eric |
| author_facet | Beaudou, Laurent Coupechoux, Pierre Dailly, Antoine Gravier, Sylvain Moncel, Julien Parreau, Aline Sopena, Eric |
| contents | Octal games are a well-defined family of two-player games played on heaps of counters, in which the players remove alternately a certain number of counters from a heap, sometimes being allowed to split a heap into two nonempty heaps, until no counter can be removed anymore. We extend the definition of octal games to play them on graphs: heaps are replaced by connected components and counters by vertices. Thus, an octal game on a path P\_n is equivalent to playing the same octal game on a heap of n counters. We study one of the simplest octal games, called 0.33, in which the players can remove one vertex or two adjacent vertices without disconnecting the graph. We study this game on trees and give a complete resolution of this game on subdivided stars and bistars. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1612_05772 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Octal Games on Graphs: The game 0.33 on subdivided stars and bistars Beaudou, Laurent Coupechoux, Pierre Dailly, Antoine Gravier, Sylvain Moncel, Julien Parreau, Aline Sopena, Eric Combinatorics Discrete Mathematics Octal games are a well-defined family of two-player games played on heaps of counters, in which the players remove alternately a certain number of counters from a heap, sometimes being allowed to split a heap into two nonempty heaps, until no counter can be removed anymore. We extend the definition of octal games to play them on graphs: heaps are replaced by connected components and counters by vertices. Thus, an octal game on a path P\_n is equivalent to playing the same octal game on a heap of n counters. We study one of the simplest octal games, called 0.33, in which the players can remove one vertex or two adjacent vertices without disconnecting the graph. We study this game on trees and give a complete resolution of this game on subdivided stars and bistars. |
| title | Octal Games on Graphs: The game 0.33 on subdivided stars and bistars |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/1612.05772 |