| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10225755 | Theoretical Computer Science | 2018 | 17 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Ãric Sopena,