A simple competitive graph coloring algorithm. II.

DOI10.1016/S0095-8956(03)00077-7zbMath1033.05039MaRDI QIDQ1425110

Henry A. Kierstead, Charles Dunn

Publication date: 15 March 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

game; planar graph; legally colored

Mathematics Subject Classification ID

05C05: Trees

05C15: Coloring of graphs and hypergraphs

Related Items

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers, The relaxed game chromatic index of \(k\)-degenerate graphs, The 6-relaxed game chromatic number of outerplanar graphs, Relaxed very asymmetric coloring games, Game-perfect graphs, Colouring games on outerplanar graphs and trees, Activation strategy for relaxed asymmetric coloring games, Relaxed game chromatic number of trees and outerplanar graphs, A simple competitive graph coloring algorithm. III, Game coloring the Cartesian product of graphs

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
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• The game coloring number of pseudo partial \(k\)-trees
• Graphs with linearly bounded Ramsey numbers
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• Radius two trees specify χ‐bounded classes
• Competitive colorings of oriented graphs
• On the oriented game chromatic number