Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7140374> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Q7140374 subject Q7217193.
- Q7140374 subject Q8498914.
- Q7140374 abstract "In graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard combinatorial problems on graphs are solvable in polynomial time when restricted to the partial k-trees, for bounded values of k.".
- Q7140374 thumbnail Partial_3-tree_forbidden_minors.svg?width=300.
- Q7140374 wikiPageWikiLink Q1067731.
- Q7140374 wikiPageWikiLink Q1137554.
- Q7140374 wikiPageWikiLink Q1187693.
- Q7140374 wikiPageWikiLink Q12027616.
- Q7140374 wikiPageWikiLink Q131476.
- Q7140374 wikiPageWikiLink Q1343660.
- Q7140374 wikiPageWikiLink Q1699014.
- Q7140374 wikiPageWikiLink Q188884.
- Q7140374 wikiPageWikiLink Q215206.
- Q7140374 wikiPageWikiLink Q223335.
- Q7140374 wikiPageWikiLink Q2300244.
- Q7140374 wikiPageWikiLink Q272735.
- Q7140374 wikiPageWikiLink Q2913731.
- Q7140374 wikiPageWikiLink Q3115543.
- Q7140374 wikiPageWikiLink Q3115604.
- Q7140374 wikiPageWikiLink Q3527155.
- Q7140374 wikiPageWikiLink Q380679.
- Q7140374 wikiPageWikiLink Q45715.
- Q7140374 wikiPageWikiLink Q462095.
- Q7140374 wikiPageWikiLink Q47506.
- Q7140374 wikiPageWikiLink Q4780395.
- Q7140374 wikiPageWikiLink Q5067368.
- Q7140374 wikiPageWikiLink Q5467387.
- Q7140374 wikiPageWikiLink Q7217193.
- Q7140374 wikiPageWikiLink Q7254793.
- Q7140374 wikiPageWikiLink Q7454787.
- Q7140374 wikiPageWikiLink Q8498914.
- Q7140374 wikiPageWikiLink Q905837.
- Q7140374 comment "In graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard combinatorial problems on graphs are solvable in polynomial time when restricted to the partial k-trees, for bounded values of k.".
- Q7140374 label "Partial k-tree".
- Q7140374 depiction Partial_3-tree_forbidden_minors.svg.