Multicolored isomorphic spanning trees in complete graphs.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2002)
- Volume: 5, Issue: 1, page 121-126
- ISSN: 1365-8050
Access Full Article
top
How to cite
topConstantine, Gregory. "Multicolored isomorphic spanning trees in complete graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 5.1 (2002): 121-126. <http://eudml.org/doc/122066>.
@article{Constantine2002,
author = {Constantine, Gregory},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {orthogonal latin squares; colorful matching; multicolored tree},
language = {eng},
number = {1},
pages = {121-126},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Multicolored isomorphic spanning trees in complete graphs.},
url = {http://eudml.org/doc/122066},
volume = {5},
year = {2002},
}
TY - JOUR
AU - Constantine, Gregory
TI - Multicolored isomorphic spanning trees in complete graphs.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2002
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 5
IS - 1
SP - 121
EP - 126
LA - eng
KW - orthogonal latin squares; colorful matching; multicolored tree
UR - http://eudml.org/doc/122066
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.