Table of Contents
International Journal of Combinatorics
Volume 2016 (2016), Article ID 1476359, 8 pages
http://dx.doi.org/10.1155/2016/1476359
Research Article

Combinatorial Analysis of a Subtraction Game on Graphs

1Department of Mathematics, California State University, Fresno, Fresno, CA 93740, USA
2Department of Mathematics, Kansas State University, Manhattan, KS 66506, USA
3Clovis Community College, Fresno, CA 93730, USA

Received 14 April 2016; Revised 13 July 2016; Accepted 1 August 2016

Academic Editor: Laszlo A. Szekely

Copyright © 2016 Richard Adams et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier Publishing, New York, NY, USA, 1976.
  2. E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways for Your Mathematical Plays, vol. 1–4, A K Peters, Natick, Mass, USA, 2nd edition, 2001.
  3. P. M. Grundy, “Mathematics and games,” Eureka, vol. 2, pp. 6–8, 1939. View at Google Scholar
  4. R. Sprague, “Über mathematische Kampfspiele,” Tohoku Mathematical Journal, vol. 41, pp. 438–444, 1936. View at Google Scholar
  5. H. L. Bodlaender and D. Kratsch, “Kayles and nimbers,” Journal of Algorithms, vol. 43, no. 1, pp. 106–119, 2002. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Guignard and É. Sopena, “Compound node-kayles on paths,” Theoretical Computer Science, vol. 410, no. 21–23, pp. 2033–2044, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. F. Harary and R. W. Robinson, “Connect-it games,” The College Mathematics Journal, vol. 15, no. 5, pp. 411–419, 1984. View at Google Scholar
  8. K. Shelton, “The game of take turn,” Integers, vol. 7, no. 2, article A31, 18 pages, 2007. View at Google Scholar
  9. A. S. Fraenkel and E. R. Scheinerman, “A deletion game on hypergraphs,” Discrete Applied Mathematics, vol. 30, no. 2-3, pp. 155–162, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. O. Kruger, “Note on Odd/Odd vertex removal games on bipartite graphs,” Integers, vol. 14, paper no. G07, 4 pages, 2014. View at Google Scholar
  11. R. J. Nowakowski and P. Ottaway, “Vertex deletion games with parity rules,” Integers, vol. 5, no. 2, article A15, 16 pages, 2005. View at Google Scholar
  12. M. Fukuyama, “A Nim game played on graphs,” Theoretical Computer Science, vol. 304, no. 1–3, pp. 387–399, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. M. Fukuyama, “A Nim game played on graphs. II,” Theoretical Computer Science, vol. 304, no. 1–3, pp. 401–419, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. E. Duchêne and G. Renault, “Vertex Nim played on graphs,” Theoretical Computer Science, vol. 516, pp. 20–27, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. M. Lącko and M. Lącki, “Gra Grim i twierdzenie Sprague'a-Grundy'ego,” http://www.deltami.edu.pl/temat/matematyka/gry_zagadki_paradoksy/2014/05/31/Gra_Grim/.
  16. A. Flammenkamp, “Sprague-Grundy values of some octal games,” http://wwwhomes.uni-bielefeld.de/achim/octal.html.
  17. I. Caines, C. Gates, R. K. Guy, and R. J. Nowakowski, “Periods in taking and splitting games,” American Mathematical Monthly, vol. 106, no. 4, pp. 359–361, 1999. View at Publisher · View at Google Scholar · View at Scopus