A Nim game played on graphs. II.

DOI10.1016/S0304-3975(03)00293-7zbMath1041.91019OpenAlexW4210534356MaRDI QIDQ1401411

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

zbMATH Keywords

Grundy numberNimImpartial gameMatchings of graphs

Mathematics Subject Classification ID

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

Related Items (8)

Connected Subtraction Games on Subdivided Stars ⋮ Unnamed Item ⋮ Combinatorial analysis of a subtraction game on graphs ⋮ Vertex Nim played on graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounded greedy Nim ⋮ Notes on the combinatorial game: graph Nim

Cites Work

• A Nim game played on graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item

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