Conjugacy of Coxeter elements.
Eriksson, Henrik, Eriksson, Kimmo (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Words with intervening neighbours in infinite Coxeter groups are reduced.”
Conjugacy of Coxeter elements.
Solitaire clobber as an optimization problem on words.
Blondel, Vincent D., Hendrickx, Julien M., Jungers, Raphaël M. (2008)
Integers
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...
On winning fast in Avoider-Enforcer games.
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Breaking symmetry on complete bipartite graphs of odd size.
Pikhurko, Oleg (2003)
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:
On Christoffel classes
Jean-Pierre Borel, Christophe Reutenauer (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We characterize conjugation classes of Christoffel words (equivalently of standard words) by the number of factors. We give several geometric proofs of classical results on these words and sturmian words.
Nondeterminism versus determinism of finite automata over directed acyclic graphs.
Potthoff, Andreas, Seibert, Sebastian, Thomas, Wolfgang (1994)
Bulletin of the Belgian Mathematical Society - Simon Stevin
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-line Ramsey theory.
Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nim-regularity of graphs.
Reading, Nathan (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
.
Pralat, Pawel (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: