Spanning trees of bounded degree.
Czygrinow, Andrzej; Fan, Genghua; Hurlbert, Glenn; Kierstead, H.A.; Trotter, William T.
The Electronic Journal of Combinatorics [electronic only] (2001)
- Volume: 8, Issue: 1, page Research paper R33, 12 p.-Research paper R33, 12 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCzygrinow, Andrzej, et al. "Spanning trees of bounded degree.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper R33, 12 p.-Research paper R33, 12 p.. <http://eudml.org/doc/121942>.
@article{Czygrinow2001,
author = {Czygrinow, Andrzej, Fan, Genghua, Hurlbert, Glenn, Kierstead, H.A., Trotter, William T.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Hamilton path; spanning tree},
language = {eng},
number = {1},
pages = {Research paper R33, 12 p.-Research paper R33, 12 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Spanning trees of bounded degree.},
url = {http://eudml.org/doc/121942},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Czygrinow, Andrzej
AU - Fan, Genghua
AU - Hurlbert, Glenn
AU - Kierstead, H.A.
AU - Trotter, William T.
TI - Spanning trees of bounded degree.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 1
SP - Research paper R33, 12 p.
EP - Research paper R33, 12 p.
LA - eng
KW - Hamilton path; spanning tree
UR - http://eudml.org/doc/121942
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.