The relaxed edge-coloring game and \(k\)-degenerate graphs

DOI10.1007/s11083-014-9336-6zbMath1325.05076OpenAlexW2008639999MaRDI QIDQ890010

Jennifer Firkins Nordstrom, David Morawski, Charles Dunn

Publication date: 9 November 2015

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-014-9336-6

zbMATH Keywords

edge coloring\(k\)-degenerate graphcompetitive coloring

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• The relaxed game chromatic index of \(k\)-degenerate graphs
• 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
• Complete multipartite graphs and the relaxed coloring game
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• Note on the game chromatic index of trees
• The game coloring number of pseudo partial \(k\)-trees
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• 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