Jump to content

Degree-constrained spanning tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 84.59.113.235 (talk) at 16:39, 30 October 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Degree Constrained Spanning Tree

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

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Degree-constrained_spanning_tree&oldid=26890941"