Previous |  Up |  Next

Article

Keywords:
extended tree; partition; vertex splitting; tree
Summary:
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.
References:
[1] Ore O.: Theory of Graphs. Providence, 1962. MR 0150753 | Zbl 0105.35401
Partner of
EuDML logo