A partition of connected graphs.
The Electronic Journal of Combinatorics [electronic only] (2005)
- Volume: 12, Issue: 1, page Research paper N1, 8 p., electronic only-Research paper N1, 8 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topWiseman, Gus. "A partition of connected graphs.." The Electronic Journal of Combinatorics [electronic only] 12.1 (2005): Research paper N1, 8 p., electronic only-Research paper N1, 8 p., electronic only. <http://eudml.org/doc/124422>.
@article{Wiseman2005,
author = {Wiseman, Gus},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {tree; graph invariants; chromatic polynomial},
language = {eng},
number = {1},
pages = {Research paper N1, 8 p., electronic only-Research paper N1, 8 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A partition of connected graphs.},
url = {http://eudml.org/doc/124422},
volume = {12},
year = {2005},
}
TY - JOUR
AU - Wiseman, Gus
TI - A partition of connected graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2005
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 12
IS - 1
SP - Research paper N1, 8 p., electronic only
EP - Research paper N1, 8 p., electronic only
LA - eng
KW - tree; graph invariants; chromatic polynomial
UR - http://eudml.org/doc/124422
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.