A Nim game played on graphs. II.

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

• Notes on the combinatorial game: graph Nim
• Nim on the complete graph.
• Computing strategies for graphical Nim
• A Nim game played on graphs.
• Games without repetitions on trees and multitrees

zbMATH Keywords

Grundy numberNimImpartial gameMatchings of graphs

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?)
• A Nim game played on graphs.

Cited In (16)

• Title not available (Why is that?)
• A Nim game played on graphs.
• Combinatorial analysis of a subtraction game on graphs
• Bounded greedy Nim
• Title not available (Why is that?)
• Games without repetitions on trees and multitrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing strategies for graphical Nim
• The game of timber!
• Nakade -- a graph theoretic concept in Go
• Combinatorial graph games
• Connected Subtraction Games on Subdivided Stars
• Notes on the combinatorial game: graph Nim
• 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)