Degree-constrained spanning tree
http://dbpedia.org/resource/Degree-constrained_spanning_tree an entity of type: WikicatNP-completeProblems
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.
rdf:langString
rdf:langString
Degree-constrained spanning tree
xsd:integer
3037035
xsd:integer
991427893
rdf:langString
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.
xsd:nonNegativeInteger
2953