Extended trees of graphs

Zelinka, Bohdan. "Extended trees of graphs." Mathematica Bohemica 119.3 (1994): 239-244. <http://eudml.org/doc/29319>.

@article{Zelinka1994,
abstract = {An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {extended tree; partition; vertex splitting; tree; extended tree; partition; vertex splitting},
language = {eng},
number = {3},
pages = {239-244},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Extended trees of graphs},
url = {http://eudml.org/doc/29319},
volume = {119},
year = {1994},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Extended trees of graphs
JO - Mathematica Bohemica
PY - 1994
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 119
IS - 3
SP - 239
EP - 244
AB - An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.
LA - eng
KW - extended tree; partition; vertex splitting; tree; extended tree; partition; vertex splitting
UR - http://eudml.org/doc/29319
ER -