The relaxed game chromatic number of outerplanar graphs

DOI10.1002/JGT.10172zbMath1042.05038OpenAlexW4238200817MaRDI QIDQ4736771

Charles Dunn, Henry A. Kierstead

Publication date: 6 August 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10172

zbMATH Keywords

outerplanar graphcompetitive coloringrelaxed coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

A simple competitive graph coloring algorithm. III ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Complete multipartite graphs and the relaxed coloring game ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ Relaxed very asymmetric coloring games ⋮ Game-perfect graphs ⋮ Colouring games on outerplanar graphs and trees ⋮ Activation strategy for relaxed asymmetric coloring games

This page was built for publication: The relaxed game chromatic number of outerplanar graphs