A note on the game chromatic index of graphs
From MaRDI portal
Publication:937247
DOI10.1007/s00373-008-0774-zzbMath1155.05021OpenAlexW2053909818MaRDI QIDQ937247
Tomasz Bartnicki, Jarosław Grytczuk
Publication date: 20 August 2008
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0774-z
Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
On the game coloring index of \(F^+\)-decomposable graphs ⋮ The game chromatic index of wheels ⋮ Majority coloring game ⋮ Indicated coloring of matroids ⋮ Game chromatic index of graphs with given restrictions on degrees ⋮ A new upper bound on the game chromatic index of graphs ⋮ The game of arboricity
Cites Work
- Game chromatic index of graphs with given restrictions on degrees
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- Note on the game chromatic index of trees
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- Game chromatic index ofk-degenerate graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- The Map-Coloring Game
This page was built for publication: A note on the game chromatic index of graphs
