A note on neighbour-distinguishing regular graphs total-weighting.
The Electronic Journal of Combinatorics [electronic only] (2008)
- Volume: 15, Issue: 1, page Research Paper N35, 5 p.-Research Paper N35, 5 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topPrzybylo, Jakub. "A note on neighbour-distinguishing regular graphs total-weighting.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper N35, 5 p.-Research Paper N35, 5 p.. <http://eudml.org/doc/129772>.
@article{Przybylo2008,
author = {Przybylo, Jakub},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {vertex colouring; proper colouring; regular graphs},
language = {eng},
number = {1},
pages = {Research Paper N35, 5 p.-Research Paper N35, 5 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A note on neighbour-distinguishing regular graphs total-weighting.},
url = {http://eudml.org/doc/129772},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Przybylo, Jakub
TI - A note on neighbour-distinguishing regular graphs total-weighting.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper N35, 5 p.
EP - Research Paper N35, 5 p.
LA - eng
KW - vertex colouring; proper colouring; regular graphs
UR - http://eudml.org/doc/129772
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.