Work

The computational complexity of Undirected Vertex Geography with maximum height 3

Year: 2026
Type: preprint
Abstract: The impartial game Undirected Vertex Geography is known to be polynomial time solvable. The variant in which vertices are assigned heights with maximum value m that reduce by 1 whenever the token is moved from that vertex, denoted UIRm, is known to be polynomial time solvable when m=2 and PSPACE-complete when m=4. We solve the open question of the computational complexity of UIR3 by a reduction from Directed vertex geography, and show that the complexity holds when the underlying graph is planar and (a) has degree at most 3, (b) is bipartite with maximum degree 4, or (c) is bipartite with maximum degree 5 and only has heights of 1 and 3.
Language: English
Open Access status: green
OpenAlex ID: W7236740124
Cites: 3
Cited by:
Related to: 10