A note on the game chromatic index of graphs
From MaRDI portal
(Redirected from A note on the game chromatic index of graphs)
Recommendations
Cites work
- A simple competitive graph coloring algorithm
- Game chromatic index of \(k\)-degenerate graphs
- Game chromatic index of graphs with given restrictions on degrees
- Note on the game chromatic index of trees
- ON THE COMPLEXITY OF SOME COLORING GAMES
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- The game coloring number of planar graphs
- The Map-Coloring Game
Cited in
(15)- On the game coloring index of \(F^+\)-decomposable graphs
- Majority coloring game
- A new upper bound on the game chromatic index of graphs
- Note on the game chromatic index of trees
- The incidence game chromatic number of \((a,d)\)-decomposable graphs
- The game of arboricity
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- Game chromatic index of \(k\)-degenerate graphs
- The game of arboricity
- Indicated coloring of matroids
- scientific article; zbMATH DE number 6438421 (Why is no real title available?)
- The game chromatic index of wheels
- The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices
- The relaxed game chromatic index of k-degenerate graphs
- Game chromatic index of graphs with given restrictions on degrees
This page was built for publication: A note on the game chromatic index of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q937247)