On monotonicity in maker-breaker graph colouring games
From MaRDI portal
Publication:6202940
Recommendations
Cites work
- scientific article; zbMATH DE number 398953 (Why is no real title available?)
- A connected version of the graph coloring game
- A note on the connected game coloring number
- Domination game and an imagination strategy
- Game chromatic index of \(k\)-degenerate graphs
- Hardness of variants of the graph coloring game
- Indicated coloring of graphs
- Majority coloring game
- ON THE COMPLEXITY OF SOME COLORING GAMES
- On the game chromatic number of sparse random graphs
- PSPACE-completeness of two graph coloring games
- Radius two trees specify χ‐bounded classes
- Refined activation strategy for the marking game
- The coloring game on matroids
- The connected greedy coloring game
- The game Grundy number of graphs
- The game chromatic number and the game colouring number of cactuses
- The game chromatic number of dense random graphs
- 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 of arboricity
This page was built for publication: On monotonicity in maker-breaker graph colouring games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202940)