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.
primaryTopic
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.
has abstract
In graph theory, a degree-cons ...... nning tree for a particular k.
@en
Wikipage page ID
Wikipage revision ID
710,754,513
hypernym
type
comment
In graph theory, a degree-cons ...... nning tree for a particular k.
@en
label
Degree-constrained spanning tree
@en