Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hal Kierstead"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 10, Iss 3 (2008)
We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a
Externí odkaz:
https://doaj.org/article/1f6e22a6d2d746acb4638c760ca2698c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
Using a fixed set of colors $C$, Ann and Ben color the edges of a graph $G$ so that no monochromatic cycle may appear. Ann wins if all edges of $G$ have been colored, while Ben wins if completing a coloring is not possible. The minimum size of $C$ fo
Externí odkaz:
https://doaj.org/article/ebba30ed7b064b3c99e297daf32cef0b