Spanning trees and function classes.
Remmel, Jeffery B.; Williamson, S.Gill
The Electronic Journal of Combinatorics [electronic only] (2002)
- Volume: 9, Issue: 1, page Research paper R34, 24 p.-Research paper R34, 24 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topRemmel, Jeffery B., and Williamson, S.Gill. "Spanning trees and function classes.." The Electronic Journal of Combinatorics [electronic only] 9.1 (2002): Research paper R34, 24 p.-Research paper R34, 24 p.. <http://eudml.org/doc/122365>.
@article{Remmel2002,
author = {Remmel, Jeffery B., Williamson, S.Gill},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {filtered digraphs; oriented spanning forests},
language = {eng},
number = {1},
pages = {Research paper R34, 24 p.-Research paper R34, 24 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Spanning trees and function classes.},
url = {http://eudml.org/doc/122365},
volume = {9},
year = {2002},
}
TY - JOUR
AU - Remmel, Jeffery B.
AU - Williamson, S.Gill
TI - Spanning trees and function classes.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2002
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 9
IS - 1
SP - Research paper R34, 24 p.
EP - Research paper R34, 24 p.
LA - eng
KW - filtered digraphs; oriented spanning forests
UR - http://eudml.org/doc/122365
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.