Degree-constrained Spanning Tree - Formal Definition

Formal Definition

Input: n-node undirected graph G(V,E); positive integer kn.

Question: Does G have a spanning tree in which no node has degree greater than k?

Read more about this topic:  Degree-constrained Spanning Tree

Famous quotes containing the words formal and/or definition:

    The formal Washington dinner party has all the spontaneity of a Japanese imperial funeral.
    Simon Hoggart (b. 1946)

    ... we all know the wag’s definition of a philanthropist: a man whose charity increases directly as the square of the distance.
    George Eliot [Mary Ann (or Marian)