This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n8https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Degree-constrained_spanning_tree
rdf:type
yago:WikicatNP-completeProblems yago:State100024720 yago:Attribute100024264 dbo:Plant yago:Problem114410605 yago:Difficulty114408086 yago:Condition113920835 yago:Abstraction100002137
rdfs:label
Degree-constrained spanning tree
rdfs:comment
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.
dcterms:subject
dbc:Spanning_tree dbc:NP-complete_problems
dbo:wikiPageID
3037035
dbo:wikiPageRevisionID
991427893
dbo:wikiPageWikiLink
dbr:Degree_(graph_theory) dbr:Node_(computer_science) dbc:Spanning_tree dbr:NP-complete dbr:Graph_theory dbr:Constant_(mathematics) dbr:Graph_(discrete_mathematics) dbr:Integer dbr:Hamiltonian_path_problem dbc:NP-complete_problems dbr:Spanning_tree_(mathematics)
owl:sameAs
n8:4isf3 wikidata:Q5251832 freebase:m.08m96h yago-res:Degree-constrained_spanning_tree
dbp:wikiPageUsesTemplate
dbt:Citation dbt:Reflist dbt:Harvtxt dbt:Harv
dbo:abstract
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.
gold:hypernym
dbr:Tree
prov:wasDerivedFrom
wikipedia-en:Degree-constrained_spanning_tree?oldid=991427893&ns=0
dbo:wikiPageLength
2953
foaf:isPrimaryTopicOf
wikipedia-en:Degree-constrained_spanning_tree
Subject Item
dbr:Minimum_degree_spanning_tree
dbo:wikiPageWikiLink
dbr:Degree-constrained_spanning_tree
Subject Item
dbr:Spanning_tree_(disambiguation)
dbo:wikiPageWikiLink
dbr:Degree-constrained_spanning_tree
dbo:wikiPageDisambiguates
dbr:Degree-constrained_spanning_tree
Subject Item
dbr:List_of_NP-complete_problems
dbo:wikiPageWikiLink
dbr:Degree-constrained_spanning_tree
Subject Item
dbr:Minimum_spanning_tree
dbo:wikiPageWikiLink
dbr:Degree-constrained_spanning_tree
Subject Item
dbr:Degree-constrained_spanning_tree_problem
dbo:wikiPageWikiLink
dbr:Degree-constrained_spanning_tree
dbo:wikiPageRedirects
dbr:Degree-constrained_spanning_tree
Subject Item
dbr:Degree_constrained_spanning_tree
dbo:wikiPageWikiLink
dbr:Degree-constrained_spanning_tree
dbo:wikiPageRedirects
dbr:Degree-constrained_spanning_tree
Subject Item
wikipedia-en:Degree-constrained_spanning_tree
foaf:primaryTopic
dbr:Degree-constrained_spanning_tree