Distinguishing chromatic numbers of bipartite graphs.
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper R76, 15 p.-Research Paper R76, 15 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topLaflamme, C., and Seyffarth, K.. "Distinguishing chromatic numbers of bipartite graphs.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R76, 15 p.-Research Paper R76, 15 p.. <http://eudml.org/doc/224254>.
@article{Laflamme2009,
author = {Laflamme, C., Seyffarth, K.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {distinguishing chromatic number},
language = {eng},
number = {1},
pages = {Research Paper R76, 15 p.-Research Paper R76, 15 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Distinguishing chromatic numbers of bipartite graphs.},
url = {http://eudml.org/doc/224254},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Laflamme, C.
AU - Seyffarth, K.
TI - Distinguishing chromatic numbers of bipartite graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R76, 15 p.
EP - Research Paper R76, 15 p.
LA - eng
KW - distinguishing chromatic number
UR - http://eudml.org/doc/224254
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.