Relaxed game chromatic number of trees and outerplanar graphs

DOI10.1016/j.disc.2003.08.006zbMath1042.05042OpenAlexW2070114706MaRDI QIDQ1827712

Jiaojiao Wu, Wenjie He, Xuding Zhu

Publication date: 6 August 2004

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

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

zbMATH Keywords

TreeDefective chromatic numberImproper chromatic numberOuterplanar graphRelaxed chromatic numberRelaxed game chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ The relaxed game chromatic number of graphs with cut-vertices ⋮ Complete multipartite graphs and the relaxed coloring game ⋮ Directed defective asymmetric graph coloring games ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Relaxed very asymmetric coloring games ⋮ Game-perfect graphs ⋮ Colouring games on outerplanar graphs and trees ⋮ Activation strategy for relaxed asymmetric coloring games

Cites Work

• 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 graphs
• The game coloring number of pseudo partial \(k\)-trees
• 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

This page was built for publication: Relaxed game chromatic number of trees and outerplanar graphs