Forestation in hypergraphs: Linear -trees.
The Electronic Journal of Combinatorics [electronic only] (2003)
- Volume: 10, Issue: 1, page Research paper N12, 6 p.-Research paper N12, 6 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topParekh, Ojas. "Forestation in hypergraphs: Linear -trees.." The Electronic Journal of Combinatorics [electronic only] 10.1 (2003): Research paper N12, 6 p.-Research paper N12, 6 p.. <http://eudml.org/doc/122991>.
@article{Parekh2003,
author = {Parekh, Ojas},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper N12, 6 p.-Research paper N12, 6 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Forestation in hypergraphs: Linear -trees.},
url = {http://eudml.org/doc/122991},
volume = {10},
year = {2003},
}
TY - JOUR
AU - Parekh, Ojas
TI - Forestation in hypergraphs: Linear -trees.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2003
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 10
IS - 1
SP - Research paper N12, 6 p.
EP - Research paper N12, 6 p.
LA - eng
UR - http://eudml.org/doc/122991
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.