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:
Displaying similar documents to “On-line Ramsey theory.”
Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
Mr. Paint and Mrs. Correct.
Schauz, Uwe (2009)
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:
On the oriented game chromatic number.
Nešetřil, J., Sopena, E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
.
Pralat, Pawel (2008)
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...
On-line list colouring of graphs.
Zhu, Xuding (2009)
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:
Breaking symmetry on complete bipartite graphs of odd size.
Pikhurko, Oleg (2003)
Integers
Similarity:
On winning fast in Avoider-Enforcer games.
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
Borodin, O.V., Ivanova, A.O., Stechkin, B.S. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
New results about impartial solitaire clobber
Eric Duchêne, Sylvain Gravier, Julien Moncel (2009)
RAIRO - Operations Research
Similarity:
Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber, introduced by Albert in 2002. The initial configuration of Impartial Solitaire Clobber is a graph, such that there is a stone placed on each of its vertex, each stone being black or white. A move of the game consists in picking a stone, and clobbering an adjacent stone of the opposite color. By clobbering we mean that the clobbered stone is removed from the graph, and replaced by the clobbering...