$[1,1,2]$-colorings of complete graphs. (English)
Congr. Numerantium 208, 99-103 (2011).
1
A proof from the book: A lower bound for the polychromatic number of the plane. (English)
Congr. Numerantium 209, 27-31 (2011).
2
From Grassmann’s vision to geometric algebra computing. (English)
Petsche, Hans-Joachim (ed.) et al., Hermann Graßmann. From past to future: Graßmann’s work in context. Proceedings of the Graßmann bicentennial conference, Potsdam, Germany and Szczecin, Poland, September 16‒19, 2009. Basel: Birkhäuser (ISBN 978-3-0346-0404-8/hbk). 423-433 (2011).
3
Edge-colorings of $K_n$ which forbid rainbow cycles. (English)
Util. Math. 83, 219-232 (2010).
4
Lights out on finite graphs. (English)
Involve 3, No. 1, 17-32 (2010).
5