Nim-regularity of graphs.
The Electronic Journal of Combinatorics [electronic only] (1999)
- Volume: 6, Issue: 1, page Research paper R11, 8 p.-Research paper R11, 8 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topReading, Nathan. "Nim-regularity of graphs.." The Electronic Journal of Combinatorics [electronic only] 6.1 (1999): Research paper R11, 8 p.-Research paper R11, 8 p.. <http://eudml.org/doc/119770>.
@article{Reading1999,
author = {Reading, Nathan},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {simplicial Nim; Nim-regular graphs},
language = {eng},
number = {1},
pages = {Research paper R11, 8 p.-Research paper R11, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Nim-regularity of graphs.},
url = {http://eudml.org/doc/119770},
volume = {6},
year = {1999},
}
TY - JOUR
AU - Reading, Nathan
TI - Nim-regularity of graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1999
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 6
IS - 1
SP - Research paper R11, 8 p.
EP - Research paper R11, 8 p.
LA - eng
KW - simplicial Nim; Nim-regular graphs
UR - http://eudml.org/doc/119770
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.