A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Relaxed very asymmetric coloring games
2009
Discrete Mathematics
This paper investigates a competitive version of the coloring game on a finite graph G. An asymmetric variant of the (r, d)relaxed coloring game is called the (r, d)-relaxed (a, b)-coloring game. In this game, two players, Alice and Bob, take turns coloring the vertices of a graph G, using colors from a set X , with |X | = r . On each turn Alice colors a vertices and Bob colors b vertices. A color α ∈ X is legal for an uncolored vertex u if by coloring u with color α, the subgraph induced by
doi:10.1016/j.disc.2007.11.058
fatcat:mp6pcco445eedo6aqjq24cfana