Geodesic
The first player wins the one-colour triangle avoidance game on 16 vertices
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 1, pp. 181-185

Voir la notice de l'article provenant de la source Library of Science

We consider the one-colour triangle avoidance game. Using a high performance computing network, we showed that the first player can win the game on 16 vertices.
Keywords: triangle avoidance game, combinatorial games 
@article{DMGT_2012_32_1_a15,
     author = {Gordinowicz, Przemys{\l}aw and Pra{\l}at, Pawe{\l}},
     title = {The first player wins the one-colour triangle avoidance game on 16 vertices},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {181--185},
     publisher = {mathdoc},
     volume = {32},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_1_a15/}
}
TY  - JOUR
AU  - Gordinowicz, Przemysław
AU  - Prałat, Paweł
TI  - The first player wins the one-colour triangle avoidance game on 16 vertices
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 181
EP  - 185
VL  - 32
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_1_a15/
LA  - en
ID  - DMGT_2012_32_1_a15
ER  - 
%0 Journal Article
%A Gordinowicz, Przemysław
%A Prałat, Paweł
%T The first player wins the one-colour triangle avoidance game on 16 vertices
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 181-185
%V 32
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_1_a15/
%G en
%F DMGT_2012_32_1_a15
Gordinowicz, Przemysław; Prałat, Paweł. The first player wins the one-colour triangle avoidance game on 16 vertices. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 1, pp. 181-185. http://geodesic.mathdoc.fr/item/DMGT_2012_32_1_a15/