The 6-relaxed game chromatic number of outerplanar graphs
type: Item
instance of: scholarly article
title: The 6-relaxed game chromatic number of outerplanar graphs
zbMATH Open document ID: 1161.05037
author: Jiaojiao Wu
author: Xuding Zhu
published in: Discrete Mathematics
publication date: 2009-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 5499739
zbMATH Keywords: relaxed colouring game
zbMATH Keywords: game chromatic number
zbMATH Keywords: two players game
Wikidata QID: Q60060537
MaRDI profile type: Publication
full work available at URL: j.disc.2007.11.015
OpenAlex ID: W1984116523
cites work: ON THE COMPLEXITY OF SOME COLORING GAMES
cites work: Game chromatic index of \(k\)-degenerate graphs
cites work: Relaxed game chromatic number of graphs
cites work: The relaxed game chromatic number of outerplanar graphs
cites work: A simple competitive graph coloring algorithm. II.
cites work: A simple competitive graph coloring algorithm. III
cites work: A bound for the game chromatic number of graphs
cites work: Q4201568
cites work: Edge-partitions of planar graphs and their game coloring numbers
cites work: Relaxed game chromatic number of trees and outerplanar graphs
cites work: Game chromatic number of outerplanar graphs
cites work: A simple competitive graph coloring algorithm
cites work: Radius two trees specify χ‐bounded classes
cites work: Competitive colorings of oriented graphs
cites work: On the oriented game chromatic number
cites work: Q5310233
cites work: The game coloring number of planar graphs
cites work: The game coloring number of pseudo partial \(k\)-trees
cites work: Refined activation strategy for the marking game
DOI: 10.1016/J.DISC.2007.11.015
description: scientific article; zbMATH DE number 5499739