Game chromatic number of Cartesian product graphs.
Bartnicki, T., Bresar, B., Grytczuk, J., Kovse, M., Miechowicz, Z., Peterin, I. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Bartnicki, T., Bresar, B., Grytczuk, J., Kovse, M., Miechowicz, Z., Peterin, I. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yang, Daqing, Zhu, Xuding (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nešetřil, J., Sopena, E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Schauz, Uwe (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Elżbieta Sidorowicz (2010)
Discussiones Mathematicae Graph Theory
Similarity:
For k ≥ 2 we define a class of graphs 𝓗 ₖ = {G: every block of G has at most k vertices}. The class 𝓗 ₖ contains among other graphs forests, Husimi trees, line graphs of forests, cactus graphs. We consider the colouring game and the generalized colouring game on graphs from 𝓗 ₖ.
Stephan Dominique Andres, Andrea Theuser (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the game colouring number of the underlying graph. Furthermore, we improve these bounds in case the underlying graph is a forest.
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kierstead, H.A., Trotter, W.T. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Prakash, Anupam, Spöhel, Reto, Thomas, Henning (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zhu, Xuding (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: