Playing Nim on a simplicial complex.
Ehrenborg, Richard, Steingrimsson, Einar (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ehrenborg, Richard, Steingrimsson, Einar (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Reading, Nathan (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kierstead, H.A., Trotter, W.T. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anuradha, V., Jain, Chinmay, Snoeyink, Jack, Szabó, Tibor (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nešetřil, J., Sopena, E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Abbasi, Sarmad, Sheikh, Numan (2007)
Integers
Similarity:
McCurdy, Sarah K., Nowakowski, Richard J. (2005)
Integers
Similarity:
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...
Nowakowski, Richard J., Ottaway, Paul (2005)
Integers
Similarity:
Yang, Daqing, Zhu, Xuding (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: