Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Leaf_power> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Leaf_power wikiPageID "49639194".
- Leaf_power wikiPageLength "6405".
- Leaf_power wikiPageOutDegree "20".
- Leaf_power wikiPageRevisionID "708414453".
- Leaf_power wikiPageWikiLink ACM_Transactions_on_Algorithms.
- Leaf_power wikiPageWikiLink Algorithmica.
- Leaf_power wikiPageWikiLink Ars_Combinatoria_(journal).
- Leaf_power wikiPageWikiLink Category:Graph_families.
- Leaf_power wikiPageWikiLink Category:Perfect_graphs.
- Leaf_power wikiPageWikiLink Chordal_graph.
- Leaf_power wikiPageWikiLink Discrete_Mathematics_(journal).
- Leaf_power wikiPageWikiLink Discrete_mathematics.
- Leaf_power wikiPageWikiLink Elsevier.
- Leaf_power wikiPageWikiLink Graph_theory.
- Leaf_power wikiPageWikiLink Information_Processing_Letters.
- Leaf_power wikiPageWikiLink Interval_graph.
- Leaf_power wikiPageWikiLink Leaf_power.
- Leaf_power wikiPageWikiLink Mathematics.
- Leaf_power wikiPageWikiLink Phylogenetic_tree.
- Leaf_power wikiPageWikiLink SIAM_Journal_on_Computing.
- Leaf_power wikiPageWikiLink Strongly_chordal_graph.
- Leaf_power wikiPageWikiLinkText "leaf power".
- Leaf_power wikiPageUsesTemplate Template:Citation.
- Leaf_power wikiPageUsesTemplate Template:Reflist.
- Leaf_power subject Category:Graph_families.
- Leaf_power subject Category:Perfect_graphs.
- Leaf_power hypernym Root.
- Leaf_power type Eukaryote.
- Leaf_power comment "In the mathematical area of graph theory, a tree T is a k-leaf root of a graph G=(V,E) if V is contained in the set of leaves of T and for vertices x,y in V, xy is an edge in E if and only if their distance in T is at most k. Then G is called a k-leaf power.".
- Leaf_power label "Leaf power".
- Leaf_power wasDerivedFrom Leaf_power?oldid=708414453.
- Leaf_power isPrimaryTopicOf Leaf_power.