The relaxed game chromatic index of \(k\)-degenerate graphs
From MaRDI portal
Publication:879391
DOI10.1016/j.disc.2006.09.025zbMath1123.05037MaRDI QIDQ879391
Publication date: 11 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.025
tree; outerplanar; planar; coloring game; relaxed coloring; (relaxed) game chromatic index; \(k\)-degenerate
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bound for the game chromatic number of graphs
- The game coloring number of planar graphs
- Relaxed coloring of a graph
- Marking games and the oriented game chromatic number of partial \(k\)-trees
- A simple competitive graph coloring algorithm. II.
- A simple competitive graph coloring algorithm
- Relaxed game chromatic number of trees and outerplanar graphs
- Relaxed game chromatic number of graphs
- A simple competitive graph coloring algorithm. III
- The game coloring number of pseudo partial \(k\)-trees
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- Radius two trees specify χ‐bounded classes
- The relaxed game chromatic number of outerplanar graphs