Winning positions in simplicial Nim.
Horrocks, David (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Nim-regularity of graphs.”
Winning positions in simplicial Nim.
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:
On winning fast in Avoider-Enforcer games.
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Playing Nim on a simplicial complex.
Ehrenborg, Richard, Steingrimsson, Einar (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Breaking symmetry on complete bipartite graphs of odd size.
Pikhurko, Oleg (2003)
Integers
Similarity:
Competitive colorings of oriented graphs.
Kierstead, H.A., Trotter, W.T. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Note: The Smallest Nonevasive Graph Property
Michał Adamaszek (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs...
Game list colouring of graphs.
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
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:
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:
On the Chvàtal-Erdős triangle game.
Balogh, József, Samotij, Wojciech (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Minimax degrees of quasiplane graphs without 4-faces.
Borodin, O.V., Ivanova, A.O., Kostochka, A.V., Sheikh, N.N. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [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: