The relaxed game chromatic index of \(k\)-degenerate graphs

DOI10.1016/j.disc.2006.09.025zbMath1123.05037OpenAlexW2037484676MaRDI QIDQ879391

Charles Dunn

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

zbMATH Keywords

treeouterplanarplanarcoloring gamerelaxed coloring(relaxed) game chromatic index\(k\)-degenerate

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ The relaxed game chromatic number of graphs with cut-vertices ⋮ On the relaxed colouring game and the unilateral colouring game

Cites Work

• 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
• Game chromatic index ofk-degenerate graphs
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Game chromatic number of outerplanar graphs
• List Improper Colourings of Planar Graphs
• Radius two trees specify χ‐bounded classes
• The relaxed game chromatic number of outerplanar graphs

This page was built for publication: The relaxed game chromatic index of \(k\)-degenerate graphs