Undirected edge geography

DOI10.1016/0304-3975(93)90026-PzbMath0801.90147WikidataQ30048559 ScholiaQ30048559MaRDI QIDQ1210301

Edward R. Scheinerman, Aviezri S. Fraenkel, Daniel H. Ullman

Publication date: 24 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

PSPACE-completeedge geography

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Related Items (17)

On the computational complexities of various geography variants ⋮ Complexity, appeal and challenges of combinatorial games ⋮ On variants of vertex geography on undirected graphs ⋮ The complexity of mean payoff games on graphs ⋮ The shortest connection game ⋮ UNO is hard, even for a single player ⋮ Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game ⋮ Bichromatic coloring game on triangulations ⋮ Feedback game on \(3\)-chromatic Eulerian triangulations of surfaces ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modular Nim ⋮ Octal games on graphs: the game 0.33 on subdivided stars and bistars ⋮ Impartial poker nim ⋮ On the shortest path game ⋮ On the complexity of the misère version of three games played on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• PSPACE-Hardness of some combinatorial games
• Complexity of problems in games, graphs and algebraic equations
• Theory of annihilation games. I
• Geography
• Complexity of path-forming games
• On the complexity of some two-person perfect-information games
• GO Is Polynomial-Space Hard

This page was built for publication: Undirected edge geography