Building graphs from colored trees.
Esselstein, Rachel M.; Winkler, Peter
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R161, 18 p., electronic only-Research Paper R161, 18 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topEsselstein, Rachel M., and Winkler, Peter. "Building graphs from colored trees.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R161, 18 p., electronic only-Research Paper R161, 18 p., electronic only. <http://eudml.org/doc/230737>.
@article{Esselstein2010,
author = {Esselstein, Rachel M., Winkler, Peter},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper R161, 18 p., electronic only-Research Paper R161, 18 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Building graphs from colored trees.},
url = {http://eudml.org/doc/230737},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Esselstein, Rachel M.
AU - Winkler, Peter
TI - Building graphs from colored trees.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper R161, 18 p., electronic only
EP - Research Paper R161, 18 p., electronic only
LA - eng
UR - http://eudml.org/doc/230737
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.