- Source: Graph coloring game
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 Steven Brams as a map-coloring game and rediscovered ten years after by Bodlaender. Its rules are as follows:
Alice and Bob color the vertices of a graph G with a set k of colors.
Alice and Bob take turns, coloring properly an uncolored vertex (in the standard version, Alice begins).
If a vertex v is impossible to color properly (for any color, v has a neighbor colored with it), then Bob wins.
If the graph is completely colored, then Alice wins.
The game chromatic number of a graph
G
{\displaystyle G}
, denoted by
χ
g
(
G
)
{\displaystyle \chi _{g}(G)}
, is the minimum number of colors needed for Alice to win the vertex coloring game on
G
{\displaystyle G}
. Trivially, for every graph
G
{\displaystyle G}
, we have
χ
(
G
)
≤
χ
g
(
G
)
≤
Δ
(
G
)
+
1
{\displaystyle \chi (G)\leq \chi _{g}(G)\leq \Delta (G)+1}
, where
χ
(
G
)
{\displaystyle \chi (G)}
is the chromatic number of
G
{\displaystyle G}
and
Δ
(
G
)
{\displaystyle \Delta (G)}
its maximum degree.
In the 1991 Bodlaender's paper, the computational complexity was left as "an interesting open problem".
Only in 2020 it was proved that the game is PSPACE-Complete.
= Relation with other notions
=Acyclic coloring. Every graph
G
{\displaystyle G}
with acyclic chromatic number
k
{\displaystyle k}
has
χ
g
(
G
)
≤
k
(
k
+
1
)
{\displaystyle \chi _{g}(G)\leq k(k+1)}
.
Marking game. For every graph
G
{\displaystyle G}
,
χ
g
(
G
)
≤
c
o
l
g
(
G
)
{\displaystyle \chi _{g}(G)\leq col_{g}(G)}
, where
c
o
l
g
(
G
)
{\displaystyle col_{g}(G)}
is the game coloring number of
G
{\displaystyle G}
. 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
G
{\displaystyle G}
belongs to at most
c
{\displaystyle c}
cycles, then
χ
g
(
G
)
≤
4
+
c
{\displaystyle \chi _{g}(G)\leq 4+c}
.
= Graph Classes
=For a class
C
{\displaystyle {\mathcal {C}}}
of graphs, we denote by
χ
g
(
C
)
{\displaystyle \chi _{g}({\mathcal {C}})}
the smallest integer
k
{\displaystyle k}
such that every graph
G
{\displaystyle G}
of
C
{\displaystyle {\mathcal {C}}}
has
χ
g
(
G
)
≤
k
{\displaystyle \chi _{g}(G)\leq k}
. In other words,
χ
g
(
C
)
{\displaystyle \chi _{g}({\mathcal {C}})}
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:
χ
g
(
F
)
=
4
{\displaystyle \chi _{g}({\mathcal {F}})=4}
. Simple criteria are known to determine the game chromatic number of a forest without vertex of degree 3. It seems difficult to determine the game chromatic number of forests with vertices of degree 3, even for forests with maximum degree 3.
Cactuses:
χ
g
(
C
)
=
5
{\displaystyle \chi _{g}({\mathcal {C}})=5}
.
Outerplanar graphs:
6
≤
χ
g
(
O
)
≤
7
{\displaystyle 6\leq \chi _{g}({\mathcal {O}})\leq 7}
.
Planar graphs:
7
≤
χ
g
(
P
)
≤
17
{\displaystyle 7\leq \chi _{g}({\mathcal {P}})\leq 17}
.
Planar graphs of given girth:
χ
g
(
P
4
)
≤
13
{\displaystyle \chi _{g}({\mathcal {P}}_{4})\leq 13}
,
χ
g
(
P
5
)
≤
8
{\displaystyle \chi _{g}({\mathcal {P}}_{5})\leq 8}
,
χ
g
(
P
6
)
≤
6
{\displaystyle \chi _{g}({\mathcal {P}}_{6})\leq 6}
,
χ
g
(
P
8
)
≤
5
{\displaystyle \chi _{g}({\mathcal {P}}_{8})\leq 5}
.
Toroidal grids:
χ
g
(
T
G
)
=
5
{\displaystyle \chi _{g}({{\mathcal {T}}G})=5}
.
Partial k-trees:
χ
g
(
T
k
)
≤
3
k
+
2
{\displaystyle \chi _{g}({\mathcal {T}}_{k})\leq 3k+2}
.
Interval graphs:
2
ω
≤
χ
g
(
I
)
≤
3
ω
−
2
{\displaystyle 2\omega \leq \chi _{g}({\mathcal {I}})\leq 3\omega -2}
, where
ω
{\displaystyle \omega }
is for a graph the size of its largest clique.
Cartesian products.
The game chromatic number of the cartesian product
G
◻
H
{\displaystyle G\square H}
is not bounded by a function of
χ
g
(
G
)
{\displaystyle \chi _{g}(G)}
and
χ
g
(
H
)
{\displaystyle \chi _{g}(H)}
. In particular, the game chromatic number of any complete bipartite graph
K
n
,
n
{\displaystyle K_{n,n}}
is equal to 3, but there is no upper bound for
χ
g
(
K
n
,
n
◻
K
m
,
m
)
{\displaystyle \chi _{g}(K_{n,n}\square K_{m,m})}
for arbitrary
n
,
m
{\displaystyle n,m}
. On the other hand, the game chromatic number of
G
◻
H
{\displaystyle G\square H}
is bounded above by a function of
col
g
(
G
)
{\displaystyle {\textrm {col}}_{g}(G)}
and
col
g
(
H
)
{\displaystyle {\textrm {col}}_{g}(H)}
. In particular, if
col
g
(
G
)
{\displaystyle {\textrm {col}}_{g}(G)}
and
col
g
(
H
)
{\displaystyle {\textrm {col}}_{g}(H)}
are both at most
t
{\displaystyle t}
, then
χ
g
(
G
◻
H
)
≤
t
5
−
t
3
+
t
2
{\displaystyle \chi _{g}(G\square H)\leq t^{5}-t^{3}+t^{2}}
.
For a single edge we have:
χ
g
(
K
2
◻
P
k
)
=
{
2
k
=
1
3
k
=
2
,
3
4
k
≥
4
χ
g
(
K
2
◻
C
k
)
=
4
k
≥
3
χ
g
(
K
2
◻
K
k
)
=
k
+
1
{\displaystyle {\begin{aligned}\chi _{g}(K_{2}\square P_{k})&={\begin{cases}2&k=1\\3&k=2,3\\4&k\geq 4\end{cases}}\\\chi _{g}(K_{2}\square C_{k})&=4&&k\geq 3\\\chi _{g}(K_{2}\square K_{k})&=k+1\end{aligned}}}
For stars we have:
χ
g
(
S
m
◻
P
k
)
=
{
2
k
=
1
3
k
=
2
4
k
≥
3
χ
g
(
S
m
◻
C
k
)
=
4
k
≥
3
{\displaystyle {\begin{aligned}\chi _{g}(S_{m}\square P_{k})&={\begin{cases}2&k=1\\3&k=2\\4&k\geq 3\end{cases}}\\\chi _{g}(S_{m}\square C_{k})&=4&&k\geq 3\end{aligned}}}
Trees:
χ
g
(
T
1
◻
T
2
)
≤
12.
{\displaystyle \chi _{g}(T_{1}\square T_{2})\leq 12.}
Wheels:
χ
g
(
P
2
◻
W
n
)
=
5
{\displaystyle \chi _{g}(P_{2}\square W_{n})=5}
if
n
≥
9.
{\displaystyle n\geq 9.}
Complete bipartite graphs:
χ
g
(
P
2
◻
K
m
,
n
)
=
5
{\displaystyle \chi _{g}(P_{2}\square K_{m,n})=5}
if
m
,
n
≥
5.
{\displaystyle m,n\geq 5.}
= Open problems
=These questions are still open to this date.
Edge coloring game
The edge coloring game, introduced by Lam, Shiu and Zu, 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:
Alice and Bob are coloring the edges a graph G with a set k of colors.
Alice and Bob are taking turns, coloring properly an uncolored edge (in the standard version, Alice begins).
If an edge e is impossible to color properly (for any color, e is adjacent to an edge colored with it), then Bob wins.
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
G
{\displaystyle G}
, denoted by
χ
g
′
(
G
)
{\displaystyle \chi '_{g}(G)}
, is the minimum number of colors needed for Alice to win this game on
G
{\displaystyle G}
.
= General case
=For every graph G,
χ
′
(
G
)
≤
χ
g
′
(
G
)
≤
2
Δ
(
G
)
−
1
{\displaystyle \chi '(G)\leq \chi '_{g}(G)\leq 2\Delta (G)-1}
. There are graphs reaching these bounds but all the graphs we know reaching this upper bound have small maximum degree.
There exists graphs with
χ
g
′
(
G
)
>
1.008
Δ
(
G
)
{\displaystyle \chi '_{g}(G)>1.008\Delta (G)}
for arbitrary large values of
Δ
(
G
)
{\displaystyle \Delta (G)}
.
Conjecture. There is an
ϵ
>
0
{\displaystyle \epsilon >0}
such that, for any arbitrary graph
G
{\displaystyle G}
, we have
χ
g
′
(
G
)
≤
(
2
−
ϵ
)
Δ
(
G
)
{\displaystyle \chi '_{g}(G)\leq (2-\epsilon )\Delta (G)}
.
This conjecture is true when
Δ
(
G
)
{\displaystyle \Delta (G)}
is large enough compared to the number of vertices in
G
{\displaystyle G}
.
Arboricity. Let
a
(
G
)
{\displaystyle a(G)}
be the arboricity of a graph
G
{\displaystyle G}
. Every graph
G
{\displaystyle G}
with maximum degree
Δ
(
G
)
{\displaystyle \Delta (G)}
has
χ
g
′
(
G
)
≤
Δ
(
G
)
+
3
a
(
G
)
−
1
{\displaystyle \chi '_{g}(G)\leq \Delta (G)+3a(G)-1}
.
= Graph Classes
=For a class
C
{\displaystyle {\mathcal {C}}}
of graphs, we denote by
χ
g
′
(
C
)
{\displaystyle \chi '_{g}({\mathcal {C}})}
the smallest integer
k
{\displaystyle k}
such that every graph
G
{\displaystyle G}
of
C
{\displaystyle {\mathcal {C}}}
has
χ
g
′
(
G
)
≤
k
{\displaystyle \chi '_{g}(G)\leq k}
. In other words,
χ
g
′
(
C
)
{\displaystyle \chi '_{g}({\mathcal {C}})}
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:
χ
g
′
(
W
3
)
=
5
{\displaystyle \chi '_{g}(W_{3})=5}
and
χ
g
′
(
W
n
)
=
n
+
1
{\displaystyle \chi '_{g}(W_{n})=n+1}
when
n
≥
4
{\displaystyle n\geq 4}
.
Forests :
χ
g
′
(
F
Δ
)
≤
Δ
+
1
{\displaystyle \chi '_{g}({\mathcal {F}}_{\Delta })\leq \Delta +1}
when
Δ
≠
4
{\displaystyle \Delta \neq 4}
, and
5
≤
χ
g
′
(
F
4
)
≤
6
{\displaystyle 5\leq \chi '_{g}({\mathcal {F}}_{4})\leq 6}
. Moreover, if every tree of a forest
F
{\displaystyle F}
of
F
4
{\displaystyle {\mathcal {F}}_{4}}
is obtained by subdivision from a caterpillar tree or contains no two adjacent vertices with degree 4, then
χ
g
′
(
F
)
≤
5
{\displaystyle \chi '_{g}(F)\leq 5}
.
= Open Problems
=Upper bound. Is there a constant
c
≥
2
{\displaystyle c\geq 2}
such that
χ
g
′
(
G
)
≤
Δ
(
G
)
+
c
{\displaystyle \chi '_{g}(G)\leq \Delta (G)+c}
for each graph
G
{\displaystyle G}
? If it is true, is
c
=
2
{\displaystyle c=2}
enough ?
Conjecture on large minimum degrees. There are a
ϵ
>
0
{\displaystyle \epsilon >0}
and an integer
d
0
{\displaystyle d_{0}}
such that any graph
G
{\displaystyle G}
with
δ
(
G
)
≥
d
0
{\displaystyle \delta (G)\geq d_{0}}
satisfies
χ
g
′
(
G
)
≥
(
1
+
ϵ
)
δ
(
G
)
{\displaystyle \chi '_{g}(G)\geq (1+\epsilon )\delta (G)}
.
Incidence coloring game
The incidence coloring game is a graph coloring game, introduced by Andres, 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:
Alice and Bob are coloring the incidences of a graph G with a set k of colors.
Alice and Bob are taking turns, coloring properly an uncolored incidence (in the standard version, Alice begins).
If an incidence i is impossible to color properly (for any color, i is adjacent to an incident colored with it), then Bob wins.
If all the incidences are properly colored, then Alice wins.
The incidence game chromatic number of a graph
G
{\displaystyle G}
, denoted by
i
g
(
G
)
{\displaystyle i_{g}(G)}
, is the minimum number of colors needed for Alice to win this game on
G
{\displaystyle G}
.
For every graph
G
{\displaystyle G}
with maximum degree
Δ
{\displaystyle \Delta }
, we have
3
Δ
−
1
2
<
i
g
(
G
)
<
3
Δ
−
1
{\displaystyle {\frac {3\Delta -1}{2}}
.
= 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
G
{\displaystyle G}
can be partitioned into two sets, one of them inducing a graph with arboricity
a
{\displaystyle a}
, the second inducing a graph with maximum degree
d
{\displaystyle d}
, then
i
g
(
G
)
≤
⌊
3
Δ
(
G
)
−
a
2
⌋
+
8
a
+
3
d
−
1
{\displaystyle i_{g}(G)\leq \left\lfloor {\frac {3\Delta (G)-a}{2}}\right\rfloor +8a+3d-1}
. If moreover
Δ
(
G
)
≥
5
a
+
6
d
{\displaystyle \Delta (G)\geq 5a+6d}
, then
i
g
(
G
)
≤
⌊
3
Δ
(
G
)
−
a
2
⌋
+
8
a
+
d
−
1
{\displaystyle i_{g}(G)\leq \left\lfloor {\frac {3\Delta (G)-a}{2}}\right\rfloor +8a+d-1}
.
Degeneracy. If
G
{\displaystyle G}
is a k-degenerated graph with maximum degree
Δ
(
G
)
{\displaystyle \Delta (G)}
, then
i
g
(
G
)
≤
2
Δ
(
G
)
+
4
k
−
2
{\displaystyle i_{g}(G)\leq 2\Delta (G)+4k-2}
. Moreover,
i
g
(
G
)
≤
2
Δ
(
G
)
+
3
k
−
1
{\displaystyle i_{g}(G)\leq 2\Delta (G)+3k-1}
when
Δ
(
G
)
≥
5
k
−
1
{\displaystyle \Delta (G)\geq 5k-1}
and
i
g
(
G
)
≤
Δ
(
G
)
+
8
k
−
2
{\displaystyle i_{g}(G)\leq \Delta (G)+8k-2}
when
Δ
(
G
)
≤
5
k
−
1
{\displaystyle \Delta (G)\leq 5k-1}
.
= Graph Classes
=For a class
C
{\displaystyle {\mathcal {C}}}
of graphs, we denote by
i
g
(
C
)
{\displaystyle i_{g}({\mathcal {C}})}
the smallest integer
k
{\displaystyle k}
such that every graph
G
{\displaystyle G}
of
C
{\displaystyle {\mathcal {C}}}
has
i
g
(
G
)
≤
k
{\displaystyle i_{g}(G)\leq k}
.
Paths : For
k
≥
13
{\displaystyle k\geq 13}
,
i
g
(
P
k
)
=
5
{\displaystyle i_{g}(P_{k})=5}
.
Cycles : For
k
≥
3
{\displaystyle k\geq 3}
,
i
g
(
C
k
)
=
5
{\displaystyle i_{g}(C_{k})=5}
.
Stars : For
k
≥
1
{\displaystyle k\geq 1}
,
i
g
(
S
2
k
)
=
3
k
{\displaystyle i_{g}(S_{2k})=3k}
.
Wheels : For
k
≥
6
{\displaystyle k\geq 6}
,
i
g
(
W
2
k
+
1
)
=
3
k
+
2
{\displaystyle i_{g}(W_{2k+1})=3k+2}
. For
k
≥
7
{\displaystyle k\geq 7}
,
i
g
(
W
2
k
)
=
3
k
{\displaystyle i_{g}(W_{2k})=3k}
.
Subgraphs of Wheels : For
k
≥
13
{\displaystyle k\geq 13}
, if
G
{\displaystyle G}
is a subgraph of
W
k
{\displaystyle W_{k}}
having
S
k
{\displaystyle S_{k}}
as a subgraph, then
i
g
(
G
)
=
⌈
3
k
2
⌉
{\displaystyle i_{g}(G)=\left\lceil {\frac {3k}{2}}\right\rceil }
.
= Open Problems
=Is the upper bound
i
g
(
G
)
<
3
Δ
(
G
)
−
1
{\displaystyle i_{g}(G)<3\Delta (G)-1}
tight for every value of
Δ
(
G
)
{\displaystyle \Delta (G)}
?
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) ?
Notes
References (chronological order)
Kata Kunci Pencarian:
- Daftar masalah matematika yang belum terpecahkan
- Graph coloring
- Graph coloring game
- List of graph theory topics
- Edge coloring
- Greedy coloring
- Col (game)
- Sim (game)
- Incidence coloring
- Shannon switching game
- List of PSPACE-complete problems
The Killer’s Game (2024)
Action, Bioskop Online, bioskop21, BioskopKeren, Cinemaindo, Comedy, Crime, Dewanonton, Drakor ID, DrakorIndo, DramaQu, DutaFilm, Ganool, gudangmovie, gudangmovie21, IndoXX1, Indoxxi, KorDramas, LayarKaca21, Layarkaca21 INDOXXI, LK21, LK21 XXI, Nonton drama, Nonton Movie, Pahe.in, PusatFilm21, USA
J.J. Perry
No More Posts Available.
No more pages to load.
