Pages that link to "Item:Q2017053"
From MaRDI portal
The following pages link to The game coloring number of planar graphs with a given girth (Q2017053):
Displaying 7 items.
- The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
- \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- On indicated coloring of lexicographic product of graphs (Q2161277) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← links)
- On monotonicity in maker-breaker graph colouring games (Q6202940) (← links)
