A Nim game played on graphs.
From MaRDI portal
Publication:1401410
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
Graph theory (including graph drawing) in computer science (68R10) Games in extensive form (91A18) Games involving graphs (91A43)
Cites Work
Cited In (22)
- The game of blocking pebbles
- Greedy Nim\(\mathrm{_k}\) game
- Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
- On the complexity of the misère version of three games played on graphs
- Chomp on generalized Kneser graphs and others
- A Nim game played on graphs. II.
- Winning positions in simplicial Nim
- Connected subtraction games on subdivided stars
- Combinatorial analysis of a subtraction game on graphs
- Bounded greedy Nim
- Power sum polynomials as relaxed EGZ polynomials
- \textsc{Transverse wave}: an impartial color-propagation game inspired by social influence and quantum NIM
- Nim on the complete graph.
- Cofinite induced subgraphs of impartial combinatorial games: an analysis of CIS-Nim
- A codex of \(\mathcal{N}\)- and \(\mathcal{P}\)-positions in Harary's `caterpillar game'
- An exact quantum algorithm for a restricted subtraction game
- Pirates and treasure
- Title not available (Why is that?)
- 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)
