scientific article; zbMATH DE number 7829456

arXiv2002.09570MaRDI QIDQ6126489

Naoki Matsumoto, Atsuki Nagao

Publication date: 9 April 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Eulerian graphtoroidal grid graphtriangular grid graphedge geographyfeedback game

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex Nim played on graphs
• On the complexity of computing winning strategies for finite poset games
• Undirected edge geography
• On the complexity of some two-person perfect-information games
• Even kernels
• Combinatorial games on a graph
• Games on graphs
• The Voronoi game on graphs and its complexity
• GO Is Polynomial-Space Hard
• On a combinatorial game

This page was built for publication: