Publication:4028100
From MaRDI portal
zbMath0770.90098MaRDI QIDQ4028100
Publication date: 28 March 1993
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
91A43: Games involving graphs
Related Items
The relaxed game chromatic index of \(k\)-degenerate graphs, Relaxed very asymmetric coloring games, Activation strategy for relaxed asymmetric coloring games, Bounded families for the on-line \(t\)-relaxed coloring, A bound for the game chromatic number of graphs, A simple competitive graph coloring algorithm. II., A simple competitive graph coloring algorithm, A simple competitive graph coloring algorithm. III