Graph coloring game

From HandWiki

The graph coloring game is a mathematical game related to graph theory. Coloring game problems arose as game-theoretic versions of well-known graph coloring problems. In a coloring game, two players use a given set of colors to construct a coloring of a graph, following specific rules depending on the game we consider. One player tries to successfully complete the coloring of the graph, when the other one tries to prevent him from achieving it.

Vertex coloring game

The vertex coloring game was introduced in 1981 by Brams[1] and rediscovered ten years after by Bodlaender.[2] Its rules are as follows:

  1. Alice and Bob color the vertices of a graph G with a set k of colors.
  2. Alice and Bob take turns, coloring properly an uncolored vertex (in the standard version, Alice begins).
  3. If a vertex v is impossible to color properly (for any color, v has a neighbor colored with it), then Bob wins.
  4. If the graph is completely colored, then Alice wins.

The game chromatic number of a graph [math]\displaystyle{ G }[/math], denoted by [math]\displaystyle{ \chi_g(G) }[/math], is the minimum number of colors needed for Alice to win the vertex coloring game on [math]\displaystyle{ G }[/math]. Trivially, for every graph [math]\displaystyle{ G }[/math], we have [math]\displaystyle{ \chi(G) \le \chi_g(G) \le \Delta(G) + 1 }[/math], where [math]\displaystyle{ \chi(G) }[/math] is the chromatic number of [math]\displaystyle{ G }[/math] and [math]\displaystyle{ \Delta(G) }[/math] its maximum degree.[3]

In the 1991 Bodlaender's paper,[4] the computational complexity was left as "an interesting open problem". Only in 2020 it was proved that the game is PSPACE-Complete.[5]


Relation with other notions

Acyclic coloring. Every graph [math]\displaystyle{ G }[/math] with acyclic chromatic number [math]\displaystyle{ k }[/math] has [math]\displaystyle{ \chi_g(G) \le k(k+1) }[/math].[6]

Marking game. For every graph [math]\displaystyle{ G }[/math], [math]\displaystyle{ \chi_g(G) \le col_g(G) }[/math], where [math]\displaystyle{ col_g(G) }[/math] is the game coloring number of [math]\displaystyle{ G }[/math]. Almost every known upper bound for the game chromatic number of graphs are obtained from bounds on the game coloring number.

Cycle-restrictions on edges. If every edge of a graph [math]\displaystyle{ G }[/math] belongs to at most [math]\displaystyle{ c }[/math] cycles, then [math]\displaystyle{ \chi_g(G) \le 4+c }[/math].[7]

Graph Classes

For a class [math]\displaystyle{ {\mathcal C} }[/math] of graphs, we denote by [math]\displaystyle{ \chi_g({\mathcal C}) }[/math] the smallest integer [math]\displaystyle{ k }[/math] such that every graph [math]\displaystyle{ G }[/math] of [math]\displaystyle{ {\mathcal C} }[/math] has [math]\displaystyle{ \chi_g(G) \le k }[/math]. In other words, [math]\displaystyle{ \chi_g({\mathcal C}) }[/math] is the exact upper bound for the game chromatic number of graphs in this class. This value is known for several standard graph classes, and bounded for some others:

  • Forests: [math]\displaystyle{ \chi_g({\mathcal F}) = 4 }[/math].[8] Simple criteria are known to determine the game chromatic number of a forest without vertex of degree 3.[9] It seems difficult to determine the game chromatic number of forests with vertices of degree 3, even for forests with maximum degree 3.
  • Cactuses: [math]\displaystyle{ \chi_g({\mathcal C}) = 5 }[/math].[10]
  • Outerplanar graphs: [math]\displaystyle{ 6 \le \chi_g({\mathcal O}) \le 7 }[/math].[11]
  • Planar graphs: [math]\displaystyle{ 7 \le \chi_g({\mathcal P}) \le 17 }[/math].[12]
  • Planar graphs of given girth: [math]\displaystyle{ \chi_g({\mathcal P}_4) \le 13 }[/math],[13] [math]\displaystyle{ \chi_g({\mathcal P}_5) \le 8 }[/math], [math]\displaystyle{ \chi_g({\mathcal P}_6) \le 6 }[/math], [math]\displaystyle{ \chi_g({\mathcal P}_8) \le 5 }[/math].[14]
  • Toroidal grids: [math]\displaystyle{ \chi_g({\mathcal TG}) = 5 }[/math].[15]
  • Partial k-trees: [math]\displaystyle{ \chi_g({\mathcal T}_k) \le 3k+2 }[/math].[16]
  • Interval graphs: [math]\displaystyle{ 2\omega \le \chi_g({\mathcal I}) \le 3\omega-2 }[/math], where [math]\displaystyle{ \omega }[/math] is for a graph the size of its largest clique.[17]

Cartesian products. The game chromatic number of the cartesian product [math]\displaystyle{ G \square H }[/math] is not bounded by a function of [math]\displaystyle{ \chi_g(G) }[/math] and [math]\displaystyle{ \chi_g(H) }[/math]. In particular, the game chromatic number of any complete bipartite graph [math]\displaystyle{ K_{n,n} }[/math] is equal to 3, but there is no upper bound for [math]\displaystyle{ \chi_g(K_{n,n} \square K_{m,m}) }[/math] for arbitrary [math]\displaystyle{ n, m }[/math].[18] On the other hand, the game chromatic number of [math]\displaystyle{ G \square H }[/math] is bounded above by a function of [math]\displaystyle{ \textrm{col}_g(G) }[/math] and [math]\displaystyle{ \textrm{col}_g(H) }[/math]. In particular, if [math]\displaystyle{ \textrm{col}_g(G) }[/math] and [math]\displaystyle{ \textrm{col}_g(H) }[/math] are both at most [math]\displaystyle{ t }[/math], then [math]\displaystyle{ \chi_g(G \square H) \le t^5 - t^3 + t^2 }[/math].[19]

  • For a single edge we have:[18]
[math]\displaystyle{ \begin{align} \chi_g(K_2 \square P_k) &= \begin{cases} 2 & k = 1 \\ 3 & k=2,3 \\ 4 & k \ge 4 \end{cases} \\ \chi_g(K_2 \square C_k) &= 4 && k \ge 3 \\ \chi_g(K_2 \square K_k) &= k+1 \end{align} }[/math]
[math]\displaystyle{ \begin{align} \chi_g(S_m \square P_k) &= \begin{cases} 2 & k = 1 \\ 3 & k=2 \\ 4 & k \ge 3 \end{cases} \\ \chi_g(S_m \square C_k) &= 4 && k \ge 3 \end{align} }[/math]
  • Trees: [math]\displaystyle{ \chi_g(T_1 \square T_2) \le 12. }[/math]
  • Wheels: [math]\displaystyle{ \chi_g(P_2 \square W_n) = 5 }[/math] if [math]\displaystyle{ n \ge 9. }[/math][20]
  • Complete bipartite graphs: [math]\displaystyle{ \chi_g(P_2 \square K_{m,n}) = 5 }[/math] if [math]\displaystyle{ m, n \ge 5. }[/math][20]

Open problems

These questions are still open to this date.

More colors for Alice [21]
  • Suppose Alice has a winning strategy for the vertex coloring game on a graph G with k colors. Does she have one for k+1 colors ?
    One would expect the answers to be "yes", as having more colors seems an advantage to Alice. However, no proof exists that this statement is true.
  • Is there a function f such that, if Alice has a winning strategy for the vertex coloring game on a graph G with k colors, then Alice has a winning strategy on G with f(k) ?
    Relaxation of the previous question.
Relations with other notions [21]
  • Suppose a monotone class of graphs (i.e. a class of graphs closed by subgraphs) has bounded game chromatic number. Is it true that this class of graph has bounded game coloring number ?
  • Suppose a monotone class of graphs (i.e. a class of graphs closed by subgraphs) has bounded game chromatic number. Is it true that this class of graph has bounded arboricity ?
  • Is it true that a monotone class of graphs of bounded game chromatic number has bounded acyclic chromatic number ?
Reducing maximum degree [9]
  • Conjecture: Is [math]\displaystyle{ F }[/math] is a forest, there exists [math]\displaystyle{ F' \subseteq F }[/math] such that [math]\displaystyle{ \Delta(F') \le \chi_g(F) }[/math] and [math]\displaystyle{ \chi_g(F') = \chi_g(F) }[/math].
  • Let [math]\displaystyle{ {\mathcal G} }[/math] be the class of graphs such that for any [math]\displaystyle{ G \in {\mathcal G} }[/math], there exists [math]\displaystyle{ G' \subseteq G }[/math] such that [math]\displaystyle{ \Delta(G') \le \chi_g(G) }[/math] and [math]\displaystyle{ \chi_g(G') = \chi_g(G) }[/math]. What families of graphs are in [math]\displaystyle{ {\mathcal G} }[/math] ?
Hypercubes[18]
  • Is it true that [math]\displaystyle{ \chi_g(G) = n+1 }[/math] for any hypercube [math]\displaystyle{ Q_n }[/math] ?
    It is known to be true for [math]\displaystyle{ n \le 4 }[/math].[18]

Edge coloring game

The edge coloring game, introduced by Lam, Shiu and Zu,[22] is similar to the vertex coloring game, except Alice and Bob construct a proper edge coloring instead of a proper vertex coloring. Its rules are as follows:

  1. Alice and Bob are coloring the edges a graph G with a set k of colors.
  2. Alice and Bob are taking turns, coloring properly an uncolored edge (in the standard version, Alice begins).
  3. If an edge e is impossible to color properly (for any color, e is adjacent to an edge colored with it), then Bob wins.
  4. If the graph is completely edge-colored, then Alice wins.

Although this game can be considered as a particular case of the vertex coloring game on line graphs, it is mainly considered in the scientific literature as a distinct game. The game chromatic index of a graph [math]\displaystyle{ G }[/math], denoted by [math]\displaystyle{ \chi'_g(G) }[/math], is the minimum number of colors needed for Alice to win this game on [math]\displaystyle{ G }[/math].

General case

For every graph G, [math]\displaystyle{ \chi'(G) \le \chi'_g(G) \le 2\Delta(G) -1 }[/math]. There are graphs reaching these bounds but all the graphs we know reaching this upper bound have small maximum degree.[22] There exists graphs with [math]\displaystyle{ \chi'_g(G) \gt 1.008\Delta(G) }[/math] for arbitrary large values of [math]\displaystyle{ \Delta(G) }[/math].[23]

Conjecture. There is an [math]\displaystyle{ \epsilon \gt 0 }[/math] such that, for any arbitrary graph [math]\displaystyle{ G }[/math], we have [math]\displaystyle{ \chi'_g(G) \le (2-\epsilon)\Delta(G) }[/math].
This conjecture is true when [math]\displaystyle{ \Delta(G) }[/math] is large enough compared to the number of vertices in [math]\displaystyle{ G }[/math].[23]

  • Arboricity. Let [math]\displaystyle{ a(G) }[/math] be the arboricity of a graph [math]\displaystyle{ G }[/math]. Every graph [math]\displaystyle{ G }[/math] with maximum degree [math]\displaystyle{ \Delta(G) }[/math] has [math]\displaystyle{ \chi'_g(G) \le \Delta(G) + 3a(G) - 1 }[/math].[24]

Graph Classes

For a class [math]\displaystyle{ {\mathcal C} }[/math] of graphs, we denote by [math]\displaystyle{ \chi'_g({\mathcal C}) }[/math] the smallest integer [math]\displaystyle{ k }[/math] such that every graph [math]\displaystyle{ G }[/math] of [math]\displaystyle{ {\mathcal C} }[/math] has [math]\displaystyle{ \chi'_g(G) \le k }[/math]. In other words, [math]\displaystyle{ \chi'_g({\mathcal C}) }[/math] is the exact upper bound for the game chromatic index of graphs in this class. This value is known for several standard graph classes, and bounded for some others:

  • Wheels: [math]\displaystyle{ \chi'_g(W_3) = 5 }[/math] and [math]\displaystyle{ \chi'_g(W_n) = n+1 }[/math] when [math]\displaystyle{ n\ge4 }[/math].[22]
  • Forests : [math]\displaystyle{ \chi'_g({\mathcal F}_\Delta) \le \Delta + 1 }[/math] when [math]\displaystyle{ \Delta \ne 4 }[/math], and [math]\displaystyle{ 5 \le \chi'_g({\mathcal F}_4) \le 6 }[/math].[25]
    Moreover, if every tree of a forest [math]\displaystyle{ F }[/math] of [math]\displaystyle{ {\mathcal F}_4 }[/math] is obtained by subdivision from a caterpillar tree or contains no two adjacent vertices with degree 4, then [math]\displaystyle{ \chi'_g(F) \le 5 }[/math].[26]

Open Problems

Upper bound. Is there a constant [math]\displaystyle{ c \ge 2 }[/math] such that [math]\displaystyle{ \chi'_g(G) \le \Delta(G) + c }[/math] for each graph [math]\displaystyle{ G }[/math] ? If it is true, is [math]\displaystyle{ c = 2 }[/math] enough ?[22]

Conjecture on large minimum degrees. There are a [math]\displaystyle{ \epsilon \gt 0 }[/math] and an integer [math]\displaystyle{ d_0 }[/math] such that any graph [math]\displaystyle{ G }[/math] with [math]\displaystyle{ \delta(G) \ge d_0 }[/math] satisfies [math]\displaystyle{ \chi'_g(G) \ge (1+\epsilon)\delta(G) }[/math]. [23]

Incidence coloring game

The incidence coloring game is a graph coloring game, introduced by Andres,[27] and similar to the vertex coloring game, except Alice and Bob construct a proper incidence coloring instead of a proper vertex coloring. Its rules are as follows:

  1. Alice and Bob are coloring the incidences of a graph G with a set k of colors.
  2. Alice and Bob are taking turns, coloring properly an uncolored incidence (in the standard version, Alice begins).
  3. If an incidence i is impossible to color properly (for any color, i is adjacent to an incident colored with it), then Bob wins.
  4. If all the incidences are properly colored, then Alice wins.

The incidence game chromatic number of a graph [math]\displaystyle{ G }[/math], denoted by [math]\displaystyle{ i_g(G) }[/math], is the minimum number of colors needed for Alice to win this game on [math]\displaystyle{ G }[/math].

For every graph [math]\displaystyle{ G }[/math] with maximum degree [math]\displaystyle{ \Delta }[/math], we have [math]\displaystyle{ \frac{3\Delta - 1}{2} \lt i_g(G) \lt 3\Delta - 1 }[/math].[27]

Relations with other notions

  • (a,d)-Decomposition. This is the best upper bound we know for the general case. If the edges of a graph [math]\displaystyle{ G }[/math] can be partitioned into two sets, one of them inducing a graph with arboricity [math]\displaystyle{ a }[/math], the second inducing a graph with maximum degree [math]\displaystyle{ d }[/math], then [math]\displaystyle{ i_g(G) \le \left\lfloor \frac{3\Delta(G) - a}{2} \right\rfloor + 8a + 3d - 1 }[/math].[28]
    If moreover [math]\displaystyle{ \Delta(G) \ge 5a + 6d }[/math], then [math]\displaystyle{ i_g(G) \le \left\lfloor \frac{3\Delta(G) - a}{2} \right\rfloor + 8a + d - 1 }[/math].[28]
  • Degeneracy. If [math]\displaystyle{ G }[/math] is a k-degenerated graph with maximum degree [math]\displaystyle{ \Delta(G) }[/math], then [math]\displaystyle{ i_g(G) \le 2\Delta(G) + 4k - 2 }[/math]. Moreover, [math]\displaystyle{ i_g(G) \le 2\Delta(G) + 3k - 1 }[/math] when [math]\displaystyle{ \Delta(G) \ge 5k - 1 }[/math] and [math]\displaystyle{ i_g(G) \le \Delta(G) + 8k - 2 }[/math] when [math]\displaystyle{ \Delta(G) \le 5k -1 }[/math].[27]

Graph Classes

For a class [math]\displaystyle{ {\mathcal C} }[/math] of graphs, we denote by [math]\displaystyle{ i_g({\mathcal C}) }[/math] the smallest integer [math]\displaystyle{ k }[/math] such that every graph [math]\displaystyle{ G }[/math] of [math]\displaystyle{ {\mathcal C} }[/math] has [math]\displaystyle{ i_g(G) \le k }[/math].

  • Paths : For [math]\displaystyle{ k \ge 13 }[/math], [math]\displaystyle{ i_g(P_k) = 5 }[/math].
  • Cycles : For [math]\displaystyle{ k \ge 3 }[/math], [math]\displaystyle{ i_g(C_k) = 5 }[/math].[29]
  • Stars : For [math]\displaystyle{ k \ge 1 }[/math], [math]\displaystyle{ i_g(S_{2k}) = 3k }[/math].[27]
  • Wheels : For [math]\displaystyle{ k \ge 6 }[/math], [math]\displaystyle{ i_g(W_{2k+1}) = 3k + 2 }[/math]. For [math]\displaystyle{ k \ge 7 }[/math], [math]\displaystyle{ i_g(W_{2k}) = 3k }[/math].[27]
  • Subgraphs of Wheels : For [math]\displaystyle{ k \ge 13 }[/math], if [math]\displaystyle{ G }[/math] is a subgraph of [math]\displaystyle{ W_k }[/math] having [math]\displaystyle{ S_k }[/math] as a subgraph, then [math]\displaystyle{ i_g(G) = \left\lceil \frac{3k}{2} \right\rceil }[/math].[30]

Open Problems

  • Is the upper bound [math]\displaystyle{ i_g(G) \lt 3\Delta(G) - 1 }[/math] tight for every value of [math]\displaystyle{ \Delta(G) }[/math] ?[27]
  • Is the incidence game chromatic number a monotonic parameter (i.e. is it as least as big for a graph G as for any subgraph of G) ?[27]

Notes

  1. ↑ (Gardner 1981)
  2. ↑ (Bodlaender 1991)
  3. ↑ With less colors than the chromatic number, there is no proper coloring of G and so Alice cannot win. With more colors than the maximum degree, there is always an available color for coloring a vertex and so Alice cannot lose.
  4. ↑ (Bodlaender 1991)
  5. ↑ (Costa, Pessoa, Soares, Sampaio 2020)
  6. ↑ (Dinski Zhu)
  7. ↑ (Junosza-Szaniawski Rożej)
  8. ↑ (Faigle et al. 1993), and implied by (Junosza-Szaniawski Rożej)
  9. ↑ 9.0 9.1 (Dunn et al. 2014)
  10. ↑ (Sidorowicz 2007), and implied by (Junosza-Szaniawski Rożej)
  11. ↑ (Guan Zhu)
  12. ↑ Upper bound by (Zhu 2008), improving previous bounds of 33 in (Kierstead Trotter), 30 implied by (Dinski Zhu), 19 in (Zhu 1999) and 18 in (Kierstead 2000). Lower bound claimed by (Kierstead Trotter). See a survey dedicated to the game chromatic number of planar graphs in (Bartnicki et al. 2007).
  13. ↑ (Sekigushi 2014)
  14. ↑ (He et al. 2002)
  15. ↑ (Raspaud Wu)
  16. ↑ (Zhu 2000)
  17. ↑ (Faigle et al. 1993)
  18. ↑ 18.0 18.1 18.2 18.3 (Peterin 2007)
  19. ↑ (Bradshaw 2021)
  20. ↑ 20.0 20.1 20.2 (Sia 2009)
  21. ↑ 21.0 21.1 (Zhu 1999)
  22. ↑ 22.0 22.1 22.2 22.3 (Lam Shiu)
  23. ↑ 23.0 23.1 23.2 (Beveridge Bohman)
  24. ↑ (Bartnicki Grytczuk), improving results on k-degenerate graphs in (Cai Zhu)
  25. ↑ Upper bound of Δ+2 by (Lam Shiu), then bound of Δ+1 by (Erdös et al. 2004) for cases Δ=3 and Δ≥6, and by (Andres 2006) for case Δ=5.
  26. ↑ Conditions on forests with Δ=4 are in (Chan Nong)
  27. ↑ 27.0 27.1 27.2 27.3 27.4 27.5 27.6 (Andres 2009a), see also erratum in (Andres 2009b)
  28. ↑ 28.0 28.1 (Charpentier Sopena), extending results of (Charpentier Sopena).
  29. ↑ (Kim 2011), improving a similar result for k ≥ 7 in (Andres 2009a) (see also erratum in (Andres 2009b))
  30. ↑ (Kim 2011)

References (chronological order)



Retrieved from "https://handwiki.org/wiki/index.php?title=Graph_coloring_game&oldid=3363304"