The following pages link to Complexity of path-forming games (Q1210546):
Displaying 13 items.
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- On the shortest path game (Q729795) (← links)
- Games on interval and permutation graph representations (Q897865) (← links)
- Undirected edge geography (Q1210301) (← links)
- Geography (Q1210545) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- On variants of vertex geography on undirected graphs (Q1627869) (← links)
- On the computational complexities of various geography variants (Q2127615) (← links)
- The shortest connection game (Q2403801) (← links)
- Playing weighted Tron on trees (Q2515573) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)