Nim-regularity of graphs.

Reading, Nathan

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

How to cite

top

Reading, 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 ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.