Nim-regularity of graphs (Q1277787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1258352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nim-regularity of graphs |
scientific article; zbMATH DE number 1258352 |
Statements
Nim-regularity of graphs (English)
0 references
8 March 1999
0 references
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.
0 references
simplicial Nim
0 references
Nim-regular graphs
0 references
0.8109555840492249
0 references
0.7970719933509827
0 references
0.7844278812408447
0 references
0.7746860384941101
0 references
0.7651270627975464
0 references
