A simple competitive graph coloring algorithm. II.

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

Charles Dunn, Henry A. Kierstead

Publication date: 15 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00077-7

zbMATH Keywords

gameplanar graphlegally colored

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ A simple competitive graph coloring algorithm. III ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ The relaxed game chromatic number of graphs with cut-vertices ⋮ The game Grundy number of graphs ⋮ Complete multipartite graphs and the relaxed coloring game ⋮ Game coloring the Cartesian product of graphs ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ 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

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
• 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
• 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
• Competitive colorings of oriented graphs
• On the oriented game chromatic number