On graphs with maximum difference between game chromatic number and chromatic number
From MaRDI portal
(Redirected from On graphs with maximum difference between game chromatic number and chromatic number)
On graphs with maximum difference between game chromatic number and chromatic number (scientific article; zbMATH DE number 7952087)
On graphs with maximum difference between game chromatic number and chromatic number (scientific article; zbMATH DE number 7952087)
Recommendations
Cites work
- A bound for the game chromatic number of graphs
- Domination game and an imagination strategy
- Hardness of variants of the graph coloring game
- scientific article; zbMATH DE number 398953 (Why is no real title available?)
- On monotonicity in maker-breaker graph colouring games
- ON THE COMPLEXITY OF SOME COLORING GAMES
- PSPACE-completeness of two graph coloring games
- Radius two trees specify χ‐bounded classes
- Refined activation strategy for the marking game
- The difference between game chromatic number and chromatic number of graphs
- The game chromatic number and the game colouring number of cactuses
- The game chromatic number of random graphs
- The game coloring number of planar graphs
- The game coloring number of planar graphs with a given girth
- The game coloring number of planar graphs with a specific girth
- The game Grundy number of graphs
This page was built for publication: On graphs with maximum difference between game chromatic number and chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646398)