The following pages link to Undirected edge geography (Q1210301):
Displaying 16 items.
- UNO is hard, even for a single player (Q389942) (← links)
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Modular Nim (Q673073) (← links)
- On the shortest path game (Q729795) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- On variants of vertex geography on undirected graphs (Q1627869) (← links)
- Octal games on graphs: the game 0.33 on subdivided stars and bistars (Q1784739) (← links)
- Impartial poker nim (Q1791298) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- On the computational complexities of various geography variants (Q2127615) (← links)
- On the complexity of the misère version of three games played on graphs (Q2354773) (← links)
- The shortest connection game (Q2403801) (← links)
- (Q3390714) (← links)
- Bichromatic coloring game on triangulations (Q6181242) (← links)
- Feedback game on \(3\)-chromatic Eulerian triangulations of surfaces (Q6202935) (← links)
