Content deleted Content added
maintainance tags; cat |
m Date the maintenance tags using AWB |
||
Line 1:
{{expand}}
{{cleanup-date|December 2006}}
{{Wikify|December 2006}}
In [[graph theory]], a '''degree-constrained spanning tree''' is a [[spanning tree (mathematics)|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''. Formally:
| |||