The 6-relaxed game chromatic number of outerplanar graphs

DOI10.1016/j.disc.2007.11.015zbMath1161.05037OpenAlexW1984116523WikidataQ60060537 ScholiaQ60060537MaRDI QIDQ998330

Jiaojiao Wu, Xuding Zhu

Publication date: 28 January 2009

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

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

zbMATH Keywords

game chromatic numberrelaxed colouring gametwo players game

Mathematics Subject Classification ID

Applications of graph theory (05C90) 2-person games (91A05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Parallel machine scheduling with general sum of processing time based models ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Colouring games on outerplanar graphs and trees

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
• 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
• Refined activation strategy for the marking game
• Game chromatic index ofk-degenerate graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• 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: The 6-relaxed game chromatic number of outerplanar graphs