Abstract
In the paper we introduce the new game—the unilateral \({\mathcal{P}}\) -colouring game which can be used as a tool to study the r-colouring game and the (r, d)-relaxed colouring game. Let be given a graph G, an additive hereditary property \({\mathcal {P}}\) and a set C of r colours. In the unilateral \({\mathcal {P}}\) -colouring game similarly as in the r-colouring game, two players, Alice and Bob, colour the uncoloured vertices of the graph G, but in the unilateral \({\mathcal {P}}\) -colouring game Bob is more powerful than Alice. Alice starts the game, the players play alternately, but Bob can miss his move. Bob can colour the vertex with an arbitrary colour from C, while Alice must colour the vertex with a colour from C in such a way that she cannot create a monochromatic minimal forbidden subgraph for the property \({\mathcal {P}}\) . If after |V(G)| moves the graph G is coloured, then Alice wins the game, otherwise Bob wins. The \({\mathcal {P}}\) -unilateral game chromatic number, denoted by \({\chi_{ug}^\mathcal {P}(G)}\) , is the least number r for which Alice has a winning strategy for the unilateral \({\mathcal {P}}\) -colouring game with r colours on G. We prove that the \({\mathcal {P}}\) -unilateral game chromatic number is monotone and is the upper bound for the game chromatic number and the relaxed game chromatic number. We give the winning strategy for Alice to play the unilateral \({\mathcal {P}}\) -colouring game. Moreover, for k ≥ 2 we define a class of graphs \({\mathcal {H}_k =\{G|{\rm every \;block \;of\;}G \; {\rm has \;at \;most}\; k \;{\rm vertices}\}}\) . The class \({\mathcal {H}_k }\) contains, e.g., forests, Husimi trees, line graphs of forests, cactus graphs. Let \({\mathcal {S}_d}\) be the class of graphs with maximum degree at most d. We find the upper bound for the \({\mathcal {S}_2}\) -unilateral game chromatic number for graphs from \({\mathcal {H}_3}\) and we study the \({\mathcal {S}_d}\) -unilateral game chromatic number for graphs from \({\mathcal {H}_4}\) for \({d \in \{2,3\}}\) . As the conclusion from these results we obtain the result for the d-relaxed game chromatic number: if \({G \in \mathcal {H}_k}\) , then \({\chi_g^{(d)}(G) \leq k + 2-d}\) , for \({k \in \{3, 4\}}\) and \({d \in \{0, \ldots, k-1\}}\) . This generalizes a known result for trees.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Andre S.D.: The game chromatic index of forests of maximum degree Δ ≥ 5. Discret. Appl. Math. 154, 1317–1323 (2006)
Bodlaender H.L.: On the complexity of some colouring games. Internat. J. Found. Comput. Sci. 2, 133–148 (1991)
Borowiecki M., Sidorowicz E.: Generalized game colouring of graphs. Discret. Math. 307, 1225–1231 (2007)
Cai L., Zhu X.: Game chromatic index of k-degenerate graphs. J. Graph Theory 36(3), 144–155 (2001)
Chou C., Wang W., Zhu X.: Relaxed game chromatic number of graphs. Discret. Math. 262, 89–98 (2003)
Dunn C.: The relaxed game chromatic index of k-degenerated graphs. Discret. Math. 307, 1767–1775 (2007)
Dunn C., Kierstead H.A.: A simple competitive graph colouring algorithm (II). J. Combin. Theory Ser. B 90, 93–106 (2004)
Dunn C., Kierstead H.A.: A simple competitive graph colouring algorithm (III). J. Combin. Theory Ser. B 90, 137–150 (2004)
Erdös P.L., Faigle U., Hochstättler W., Kern W.: Note on the game chromatic index of trees. Theor. Comput. Sci. 313, 371–376 (2004)
Faigle U., Kern U., Kierstead H.A., Trotter W.T.: On the game chromatic number of some classes of graphs. Ars Combin. 35, 143–150 (1993)
Guan D., Zhu X.: The game chromatic number of outerplanar graphs. J. Graph Theory 30, 67–70 (1999)
He W., Wu J., Zhu X.: Relaxed game chromatic number of trees and outerplanar graphs. Discret. Math. 281, 209–219 (2004)
Kierstead H.A.: A simple competitive graph colouring algorithm. J. Combin. Theory Ser. B 78, 57–68 (2000)
Kierstead, H.A., Trotter, W.T.: Competitive colorings of oriented graphs. Electron. J. Combin. 8(12) (2001)
Sidorowicz E.: Colouring game and generalized colouring game on graphs with cut-vertices. Discuss. Math. Graph Theory 30, 499–533 (2010)
Wu J., Zhu X.: Relaxed game chromatic number of outerplanar graphs. Ars Combin. 81, 359–367 (2006)
Wu J., Zhu X.: The 6-relaxed game chromatic number of outerplanar graphs. Discret. Math. 308, 5974–5980 (2008)
Yang D., Zhu X.: Activation strategy for asymmetric marking games. Eur. J. Comb. 29, 1123–1132 (2008)
Yang D.: Activation strategy for relaxed asymmetric coloring games. Discret. Math. 309, 3323–3335 (2009)
Zhu X.: The Game Colouring Number of Planar Graphs. J. Combin. Theory Ser. B 75, 245–258 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
About this article
Cite this article
Sidorowicz, E. On the Relaxed Colouring Game and the Unilateral Colouring Game. Graphs and Combinatorics 30, 1013–1036 (2014). https://doi.org/10.1007/s00373-013-1326-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-013-1326-8