Generalised game colouring of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 398953 (Why is no real title available?)
- 25 pretty graph colouring problems
- A bound for the game chromatic number of graphs
- A simple competitive graph coloring algorithm
- A survey of hereditary properties of graphs
- Game chromatic index of \(k\)-degenerate graphs
- Game chromatic number of outerplanar graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- On the oriented game chromatic number
- Radius two trees specify χ‐bounded classes
- Relaxed game chromatic number of graphs
- The game coloring number of planar graphs
Cited in
(13)- Hypergraph Coloring Games and Voter Models
- Adapted game colouring of graphs
- Proper colouring painter-builder game
- A Game Theoretic Approach for Efficient Graph Coloring
- On the relaxed colouring game and the unilateral colouring game
- Hypergraph Coloring Games and Voter Models
- Two graph-colouring games
- On the game coloring index of \(F^+\)-decomposable graphs
- Game list colouring of graphs
- Colouring game and generalized colouring game on graphs with cut-vertices
- PSPACE-hardness of two graph coloring games
- Abstract colorings, games and ultrafilters
- The edge coloring game on trees with the number of colors greater than the game chromatic index
This page was built for publication: Generalised game colouring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878606)