Relaxed game chromatic number of graphs
From MaRDI portal
Publication:1868839
DOI10.1016/S0012-365X(02)00521-6zbMath1012.05067MaRDI QIDQ1868839
Chun-Yen Chou, Wei Fan Wang, Xuding Zhu
Publication date: 28 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (21)
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ Generalised game colouring of graphs ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Adapted game colouring of graphs ⋮ The relaxed game chromatic number of graphs with cut-vertices ⋮ The game chromatic index of wheels ⋮ A simple competitive graph coloring algorithm. II. ⋮ Complete multipartite graphs and the relaxed coloring game ⋮ Directed defective asymmetric graph coloring games ⋮ The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Relaxed very asymmetric coloring games ⋮ Game-perfect graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Colouring games on outerplanar graphs and trees ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Relaxed game chromatic number of trees and outerplanar graphs ⋮ Bounded families for the on-line \(t\)-relaxed coloring
This page was built for publication: Relaxed game chromatic number of graphs
