Connected subtraction games on subdivided stars
From MaRDI portal
(Redirected from Publication:5207818)
Abstract: The present paper deals with connected subtraction games in graphs, which are generalization of takeaway games. In a connected subtraction game, two players alternate removing a connected sub-graph from a given connected game-graph, provided the resulting graph is connected, and provided the number of vertices of the removed subgraph belongs to a prescribed set of integers. We derive general periodicity results on such games, as well as specific results when played on subdivided stars.
Recommendations
Cites work
- A Nim game played on graphs.
- A Nim game played on graphs. II.
- Combinatorial analysis of a subtraction game on graphs
- Combinatorial game theory
- scientific article; zbMATH DE number 5145315 (Why is no real title available?)
- scientific article; zbMATH DE number 16392 (Why is no real title available?)
- Octal games on graphs: the game 0.33 on subdivided stars and bistars
- On the complexity of some two-person perfect-information games
- Polynomial time graph families for Arc Kayles
- Winning ways for your mathematical plays. Vol. 1.
Cited in
(2)
This page was built for publication: Connected subtraction games on subdivided stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207818)
