Activation strategy for relaxed asymmetric coloring games

DOI10.1016/j.disc.2008.09.047zbMath1167.91009OpenAlexW2019885790MaRDI QIDQ1025957

Daqing Yang

Publication date: 23 June 2009

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

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

zbMATH Keywords

planar graphspartial \(k\)-treesrelaxed chromatic numberasymmetric coloring gamespseudo-partial \(k\)-trees

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Coloring games on squares of graphs ⋮ On the relaxed colouring game and the unilateral colouring game

Cites Work

• Unnamed Item
• Unnamed Item
• Activation strategy for asymmetric marking games
• Relaxed very asymmetric coloring games
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• Orderings on graphs and game coloring number
• 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
• Graphs with linearly bounded Ramsey numbers
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• Asymmetric marking games on line graphs
• Weak acyclic coloring and asymmetric coloring games
• Very asymmetric marking games
• The Two-Coloring Number and Degenerate Colorings of Planar Graphs
• Radius two trees specify χ‐bounded classes
• Asymmetric graph coloring games
• The relaxed game chromatic number of outerplanar graphs

This page was built for publication: Activation strategy for relaxed asymmetric coloring games