The Polynomial Profile of Distance Games on Paths and Cycles

zbMath1505.91116arXiv2111.09349MaRDI QIDQ5042429

Svenja Huntemann, Lexi Nash

Publication date: 19 October 2022

Full work available at URL: https://arxiv.org/abs/2111.09349

zbMATH Keywords

combinatorial gamesdistance gamesenumeration of positions

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating independent vertex sets in grid graphs
• Enumeration by kernel positions
• On the complexity of some two-person perfect-information games
• The Go polynomials of a graph.
• Simplicial complexes are game complexes
• On the number of go positions on lattice graphs
• Maximal independent sets on a grid graph
• Counting Domineering Positions
• Combinatorics of Go

This page was built for publication: The Polynomial Profile of Distance Games on Paths and Cycles