Degree-constrained spanning tree
id:
degree-constrained-spanning-tree-274-3941593
title:
Degree-constrained spanning tree
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Degree-constrained_spanning_tree
date created:
date modified:
2020-11-30T00:46:38Z
main entity:
{"identifier":"Q5251832","url":"https://www.wikidata.org/entity/Q5251832"}
image:
fields total:
13
integrity:
13