A simple competitive graph coloring algorithm. III

DOI10.1016/j.jctb.2004.03.010zbMath1056.05056OpenAlexW2083586321MaRDI QIDQ1880795

Charles Dunn, Henry A. Kierstead

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.03.010

zbMATH Keywords

playerwinning strategy

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ 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 ⋮ A simple competitive graph coloring algorithm. II. ⋮ Activation strategy for asymmetric marking games ⋮ Refined activation strategy for the marking game ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• The game coloring number of pseudo partial \(k\)-trees
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• The relaxed game chromatic number of outerplanar graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Competitive colorings of oriented graphs
• On the oriented game chromatic number

This page was built for publication: A simple competitive graph coloring algorithm. III