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:
Displaying similar documents to “A deletion game on graphs: “Le Pic Arête'.”
Game chromatic number of Cartesian product graphs.
Winning strong games through fast strategies for weak games.
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cutthroat, an all-small game on graphs.
McCurdy, Sarah K., Nowakowski, Richard J. (2005)
Integers
Similarity:
Game colouring directed graphs.
Yang, Daqing, Zhu, Xuding (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vertex deletion games with parity rules.
Nowakowski, Richard J., Ottaway, Paul (2005)
Integers
Similarity:
On winning fast in Avoider-Enforcer games.
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Game list colouring of graphs.
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Carrying umbrellas: An online relocation game on a graph.
Lee, Jae-Ha, Park, Chong-Dae, Chwa, Kyung-Yong (2001)
Journal of Graph Algorithms and Applications
Similarity:
.
Pralat, Pawel (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the complexity of -player Hackenbush.
Cincotti, Alessandro (2009)
Integers
Similarity:
On the oriented game chromatic number.
Nešetřil, J., Sopena, E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Positions of value in generalized domineering and chess.
Drummond-Cole, Gabriel C. (2005)
Integers
Similarity:
How long can a graph be kept planar?
Anuradha, V., Jain, Chinmay, Snoeyink, Jack, Szabó, Tibor (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: