Extended trees of graphs
Mathematica Bohemica, Tome 119 (1994) no. 3, pp. 239-244
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR Zbl
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.
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.
DOI :
10.21136/MB.1994.126165
Classification :
05C05
Keywords: extended tree; partition; vertex splitting; tree
Keywords: extended tree; partition; vertex splitting; tree
Zelinka, Bohdan. Extended trees of graphs. Mathematica Bohemica, Tome 119 (1994) no. 3, pp. 239-244. doi: 10.21136/MB.1994.126165
@article{10_21136_MB_1994_126165,
author = {Zelinka, Bohdan},
title = {Extended trees of graphs},
journal = {Mathematica Bohemica},
pages = {239--244},
year = {1994},
volume = {119},
number = {3},
doi = {10.21136/MB.1994.126165},
mrnumber = {1305527},
zbl = {0814.05027},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1994.126165/}
}