Relaxed very asymmetric coloring games

DOI10.1016/j.disc.2007.11.058zbMath1193.05082OpenAlexW2030991289MaRDI QIDQ1011775

Daqing Yang

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.058

zbMATH Keywords

graph orientationasymmetric coloring gamecompetitive coloringrelaxed chromatic numberrelaxed game chromatic number

Mathematics Subject Classification ID

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

Related Items (2)

Coloring games on squares of graphs ⋮ Activation strategy for relaxed asymmetric coloring games

Cites Work

• Unnamed Item
• Unnamed Item
• The game coloring number of planar graphs
• 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
• Asymmetric marking games on line graphs
• Very asymmetric marking games
• Asymmetric graph coloring games
• The relaxed game chromatic number of outerplanar graphs

This page was built for publication: Relaxed very asymmetric coloring games