Degree-constrained Spanning Tree

In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem is to determine whether a particular graph has such a spanning tree for a particular k.

Read more about Degree-constrained Spanning Tree:  Formal Definition, NP-completeness, Degree-constrained Minimum Spanning Tree, Approximation Algorithm

Famous quotes containing the word tree:

    Sin, guilt, neurosis—they are one and the same, the fruit of the tree of knowledge.
    Henry Miller (1891–1980)