. Proof, The first values can easily by checked. For cases 3 and 4 we proceed by induction on n

P. Since, ?. , ?. , ?. E. Adams, and E. C. Benson, = ?(P 5n ) = 0, we get ?(P 5n+1 ) = ?(P 5n+2 ) = ?(P 5n+3 ) = 1. Observe (as in the proof of Lemma 16) that every option of P 5n or P 5n+4 contains a path of order m ? 1, 2 or 3 (mod 5) Therefore, by Lemma 16, every such option is a winning position, and thus ?(P 5n ) = ?(P 5n+4 ) = 0. Compound version Losing set L disj. comp., normal play {0 Nim-type games, 10} conj. comp., misère play {1, 2} cont. conj. comp., normal play {5, 1956.

D. T. Allemang, Generalized genus sequences for mis??re octal games, International Journal of Game Theory, vol.30, issue.4, pp.539-556, 2001.
DOI : 10.1007/s001820200097

E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways. Two volumes, 1982.

H. L. Bodlaender and D. Kratsch, Kayles and Nimbers, Journal of Algorithms, vol.43, issue.1, pp.106-119, 2002.
DOI : 10.1006/jagm.2002.1215

J. H. Conway, Numbers and games, 1976.
DOI : 10.1090/psapm/043/1095538

T. R. Dawson, Caissa's wild roses Reprinted in: Five Classics of Fairy Chess, 1935.

´. E. Duchêne-duchêne, S. Gravier, and M. Mhalla, Jeux combinatoires sur les graphes (in french) Combinatorial graph games, Ars Combin, 2006.

H. E. Dudeney, Canterbury Puzzles, p.118, 1910.

A. Flammenkamp, Octal games

R. Fleischer and G. Trippen, Kayles on the Way to the Stars, Proc. 4th Int. Conf. on Computers and Games, pp.232-245, 2004.
DOI : 10.1007/11674399_16

P. M. Grundy, Mathematics and games, pp.6-8, 1939.

R. K. Guy and C. A. Smith, The G-values of various games, Proc. Cambridge Philos. Soc, pp.539-556, 1956.
DOI : 10.1017/S0305004100031509

S. Loyd, Cyclopedia of Tricks and Puzzles, page 232, 1914.

T. E. Plambeck, Misère Games

T. E. Plambeck, Taming the wild in impartial combinatorial games. INTEGERS: The Electr, J. Combin. Number Theory, 2005.

T. J. Schaeffer, On the complexity of some two-person perfect-information games, Journal of Computer and System Sciences, vol.16, issue.2, pp.185-225, 1978.
DOI : 10.1016/0022-0000(78)90045-4

W. L. Sibert and J. H. Conway, Mathematical kayles, International Journal of Game Theory, vol.37, issue.3, pp.237-246, 1992.
DOI : 10.1007/BF01253778

C. A. Smith, Graphs and composite games, Journal of Combinatorial Theory, vol.1, issue.1, pp.51-81438, 1936.
DOI : 10.1016/S0021-9800(66)80005-4

W. Stromquist and D. Ullman, Sequential compounds of combinatorial games, Theoretical Computer Science, vol.119, issue.2, pp.311-321, 1993.
DOI : 10.1016/0304-3975(93)90162-M