A Nim game played on graphs.

DOI10.1016/S0304-3975(03)00292-5zbMATH Open1041.91018MaRDI QIDQ1401410FDOQ1401410

Authors: Masahiko Fukuyama 

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• A Nim game played on graphs. II.
• Notes on the combinatorial game: graph Nim
• Nim on the complete graph.
• On the complexity of the misère version of three games played on graphs
• Playing Nim on a simplicial complex

zbMATH Keywords

Grundy numberNimMenger's theoremImpartial game

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Games in extensive form (91A18) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• Greedy Nim\(\mathrm{_k}\) game
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
• A Nim game played on graphs. II.
• Winning positions in simplicial Nim
• Combinatorial analysis of a subtraction game on graphs
• Title not available (Why is that?)
• An exact quantum algorithm for a restricted subtraction game
• Title not available (Why is that?)
• Connected Subtraction Games on Subdivided Stars
• Notes on the combinatorial game: graph Nim
• Vertex Nim played on graphs
• A Graph-Grabbing Game
• Title not available (Why is that?)

This page was built for publication: A Nim game played on graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401410)