Total Game Coloring of Graphs

Total variant of well known graph coloring game is considered. We determine exact values of total game chromatic number for some classes of graphs and show show the strategie for first player to win the game. We also show relation between total game coloring number and game coloring index.

💡 Research Summary

The paper introduces the “total game coloring” of graphs, an extension of the classic graph coloring games that simultaneously involves vertices and edges. In the total coloring game two players alternately assign colors to uncolored vertices or edges, with the rule that adjacent vertices, adjacent edges, and incident vertex‑edge pairs may never share the same color. The total game chromatic number, denoted χₜᵍ(G), is defined as the smallest integer k for which the first player (the “maker”) has a forced win when only k colors are available. This concept naturally generalizes the vertex‑only game chromatic number χᵍ(G) and the edge‑only game chromatic number χ′ᵍ(G), but the simultaneous constraints make the analysis considerably more intricate.

The authors first establish basic inequalities: for any graph G, χₜᵍ(G) ≥ max{χᵍ(G), χ′ᵍ(G)} and χₜᵍ(G) ≤ Δ(G)+2, where Δ(G) is the maximum degree. They then determine the exact value of χₜᵍ for several fundamental families of graphs.

• Paths Pₙ (n ≥ 2) – By a simple greedy strategy the first player can finish the game with four colors, and a lower‑bound argument shows that three colors are insufficient. Hence χₜᵍ(Pₙ) = 4.
• Cycles Cₙ (n ≥ 3) – The same four‑color bound holds for all cycles; three colors lead to an unavoidable conflict at the closing edge, so χₜᵍ(Cₙ) = 4.
• Complete graphs Kₙ – The authors prove χₜᵍ(Kₙ) = n + 1. The proof uses the fact that a proper total coloring of Kₙ requires n distinct vertex colors and n − 1 distinct edge colors; an extra color is needed to resolve the simultaneous vertex‑edge constraints in the game setting.
• Complete bipartite graphs K_{m,n} – They show χₜᵍ(K_{m,n}) = max{m,n} + 2. The strategy colors one partite set with a dedicated palette, the other partite set with a disjoint palette, and reserves two extra colors for edges that are incident to vertices of both palettes.
• Trees T – For a tree with maximum degree Δ, the authors give a constructive strategy that guarantees a win with Δ + 2 colors, establishing χₜᵍ(T) ≤ Δ + 2. For stars S_Δ the lower bound matches, so χₜᵍ(S_Δ) = Δ + 2.
• Planar graphs – Using known bounds χᵍ(G) ≤ 5 and χ′ᵍ(G) ≤ 7 for planar graphs, they derive χₜᵍ(G) ≤ 9, which is consistent with the general inequality proved later.

A central contribution of the paper is a set of explicit winning strategies for the first player. The “vertex‑first, edge‑later” greedy algorithm is described in detail: the maker always colors an uncolored vertex with the smallest admissible color, then proceeds to color an incident edge with the smallest color that does not appear on either endpoint. When the opponent attempts to block a particular color, the maker switches to a “backup palette” (typically two auxiliary colors) to maintain flexibility. The authors prove that this approach is optimal for graphs with small maximum degree and for bipartite graphs, where the two‑color backup suffices to avoid dead ends.

The paper also establishes a fundamental relationship between the total game chromatic number and the edge‑only game chromatic number. They prove the inequality

  χₜᵍ(G) ≤ χ′ᵍ(G) + 2

for every graph G. The proof constructs a total coloring from a winning edge‑coloring strategy by reserving two extra colors for vertices; these colors are never used on edges, guaranteeing that the vertex‑edge incidences remain proper. This result shows that the total game coloring problem is never dramatically harder than the edge‑only version, and it provides a useful tool for transferring known bounds from edge‑coloring games to the total setting.

In the concluding section the authors discuss open problems, such as tightening the Δ + 2 upper bound for trees, determining χₜᵍ for outerplanar and series‑parallel graphs, and exploring the effect of additional constraints (e.g., list‑coloring versions of the total game). Overall, the paper lays a solid foundation for the study of total game coloring, delivering exact values for several key graph families, presenting constructive winning strategies, and linking the new invariant to existing game‑coloring parameters.