Pages that link to "Item:Q2182325"
From MaRDI portal
The following pages link to PSPACE-completeness of two graph coloring games (Q2182325):
Displaying 9 items.
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- The complexity of two colouring games (Q2696280) (← links)
- The connected greedy coloring game (Q2699943) (← links)
- The PSPACE-Completeness of Black-White Pebbling (Q3068646) (← links)
- The general position avoidance game and hardness of general position games (Q6150675) (← links)
- On monotonicity in maker-breaker graph colouring games (Q6202940) (← links)
- On graphs with maximum difference between game chromatic number and chromatic number (Q6646398) (← links)