Nim-regularity of graphs

MaRDI QIDQ1277787zbMATH OpenFDO

Authors Nathan Reading

Publication date 8 March 1999

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119770, http://www.emis.de/journals/EJC/Volume_6/v6i1toc.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Nim-regular graphssimplicial Nim

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Games involving topology, set theory, or logic (91A44) Combinatorial games (91A46)

Review text

Summary: Ehrenborg and Steingrímsson defined simplicial Nim, and defined Nim-regular complexes to be simplicial complexes for which simplicial Nim has a particular type of winning strategy. We completely characterize the Nim-regular graphs by the exclusion of two vertex induced subgraphs, the graph on three vertices with one edge and the graph on five vertices which is complete except for one missing edge. We show that all Nim-regular graphs have as their basis the set of disjoint unions of circuits (minimal non-faces) of the graph.

Recommendations

• Playing Nim on a simplicial complex
• A Nim game played on graphs. II.
• Winning positions in simplicial Nim
• Notes on the combinatorial game: graph Nim
• Nim on the complete graph.

Cited in

(3)

• Playing Nim on a simplicial complex
• scientific article; zbMATH DE number 6438474 (Why is no real title available?)
• Winning positions in simplicial Nim

This page was built for publication: Nim-regularity of graphs

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