Planar graph coloring with an uncooperative partner
Journal of Graph Theory
Journal of Graph Theory
A bound for the game chromatic number of graphs
Discrete Mathematics
The game coloring number of planar graphs
Journal of Combinatorial Theory Series B
The game coloring number of pseudo partial k-trees
Discrete Mathematics
A simple competitive graph coloring algorithm
Journal of Combinatorial Theory Series B
List Improper Colourings of Planar Graphs
Combinatorics, Probability and Computing
Game chromatic number of outerplanar graphs
Journal of Graph Theory
Acrylic improper colorings of graphs
Journal of Graph Theory
Game chromatic index of k-degenerate graphs
Journal of Graph Theory
A simple competitive graph coloring algorithm II
Journal of Combinatorial Theory Series B
A simple competitive graph coloring algorithm III
Journal of Combinatorial Theory Series B
Bounded families for the on-line t-relaxed coloring
Information Processing Letters
The game chromatic index of forests of maximum degree Δ≥5
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The game chromatic index of forests of maximum degree Δ≥5
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Bounded families for the on-line t-relaxed coloring
Information Processing Letters
Directed defective asymmetric graph coloring games
Discrete Applied Mathematics
Adapted game colouring of graphs
European Journal of Combinatorics
Hi-index | 0.05 |
This paper discusses a coloring game on graphs. Let k, d be non-negative integers and C a set of k colors. Two persons, Alice and Bob, alternately color the vertices of G with colors from C, with Alice having the first move. A color i is legal for an uncolored vertex x if by coloring x with color i, the subgraph of G induced by those vertices of color i has maximum degree at most d. Each move of Alice or Bob colors an uncolored vertex with a legal color. The game is over if either all vertices are colored, or no more vertices can be colored with a legal color. Alice's goal is to produce a legal coloring which colors all the vertices of G, and Bob's goal is to prevent this from happening. We shall prove that if G is a forest, then for k = 3, d ≥ 1, Alice has a winning strategy. If G is an outerplanar graph, then for k = 6 and d ≥ 1, Alice has a winning strategy.