A Nim game played on graphs. II.
From MaRDI portal
Publication:1401411
DOI10.1016/S0304-3975(03)00293-7zbMATH Open1041.91019OpenAlexW4210534356MaRDI QIDQ1401411FDOQ1401411
Authors: Masahiko Fukuyama 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00293-7
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Games in extensive form (91A18) Games involving graphs (91A43)
Cites Work
Cited In (24)
- 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.
- Sprague-Grundy function of symmetric hypergraphs
- Connected subtraction games on subdivided stars
- Combinatorial analysis of a subtraction game on graphs
- On Kotzig's Nim
- A PSPACE-complete graph nim
- Bounded greedy Nim
- Title not available (Why is that?)
- Games without repetitions on trees and multitrees
- Power sum polynomials as relaxed EGZ polynomials
- Title not available (Why is that?)
- Nim on the complete graph.
- Computing strategies for graphical Nim
- The game of timber!
- A codex of \(\mathcal{N}\)- and \(\mathcal{P}\)-positions in Harary's `caterpillar game'
- Nakade -- a graph theoretic concept in Go
- Combinatorial graph games
- Pyramid Nim
- Notes on the combinatorial game: graph Nim
- A variant of Nim played on Boolean matrices
- Vertex Nim played on graphs
- Title not available (Why is that?)
This page was built for publication: A Nim game played on graphs. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401411)
