On winning fast in Avoider-Enforcer games.
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “How long can a graph be kept planar?”
On winning fast in Avoider-Enforcer games.
On the Chvàtal-Erdős triangle game.
Balogh, József, Samotij, Wojciech (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Breaking symmetry on complete bipartite graphs of odd size.
Pikhurko, Oleg (2003)
Integers
Similarity:
Game list colouring of graphs.
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Competitive colorings of oriented graphs.
Kierstead, H.A., Trotter, W.T. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Balanced online Ramsey games in random graphs.
Prakash, Anupam, Spöhel, Reto, Thomas, Henning (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Winning strong games through fast strategies for weak games.
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On two problems regarding the Hamiltonian cycle game.
Hefetz, Dan, Stich, Sebastian (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nim-regularity of graphs.
Reading, Nathan (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On-line Ramsey theory.
Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the oriented game chromatic number.
Nešetřil, J., Sopena, E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Game colouring directed graphs.
Yang, Daqing, Zhu, Xuding (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: