Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Prüfer_sequence> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Prüfer_sequence abstract "In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n − 2, and can be generated by a simple iterative algorithm. Prüfer sequences were first used by Heinz Prüfer to prove Cayley's formula in 1918.".
- Prüfer_sequence thumbnail Tree_graph.svg?width=300.
- Prüfer_sequence wikiPageExternalLink PrueferCode.html.
- Prüfer_sequence wikiPageID "1650168".
- Prüfer_sequence wikiPageLength "6525".
- Prüfer_sequence wikiPageOutDegree "16".
- Prüfer_sequence wikiPageRevisionID "702520238".
- Prüfer_sequence wikiPageWikiLink Bijection.
- Prüfer_sequence wikiPageWikiLink Bipartite_graph.
- Prüfer_sequence wikiPageWikiLink Category:Enumerative_combinatorics.
- Prüfer_sequence wikiPageWikiLink Category:Trees_(graph_theory).
- Prüfer_sequence wikiPageWikiLink Cayleys_formula.
- Prüfer_sequence wikiPageWikiLink Combinatorics.
- Prüfer_sequence wikiPageWikiLink Complete_graph.
- Prüfer_sequence wikiPageWikiLink Heinz_Prüfer.
- Prüfer_sequence wikiPageWikiLink MathWorld.
- Prüfer_sequence wikiPageWikiLink Mathematics.
- Prüfer_sequence wikiPageWikiLink Multinomial_theorem.
- Prüfer_sequence wikiPageWikiLink Sequence.
- Prüfer_sequence wikiPageWikiLink Spanning_tree.
- Prüfer_sequence wikiPageWikiLink Tree_(graph_theory).
- Prüfer_sequence wikiPageWikiLink File:Tree_graph.svg.
- Prüfer_sequence wikiPageWikiLinkText "Prüfer coding".
- Prüfer_sequence wikiPageWikiLinkText "Prüfer sequence".
- Prüfer_sequence wikiPageUsesTemplate Template:Reflist.
- Prüfer_sequence subject Category:Enumerative_combinatorics.
- Prüfer_sequence subject Category:Trees_(graph_theory).
- Prüfer_sequence hypernym Sequence.
- Prüfer_sequence type Combinatoric.
- Prüfer_sequence type Diacritic.
- Prüfer_sequence type Redirect.
- Prüfer_sequence comment "In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n − 2, and can be generated by a simple iterative algorithm. Prüfer sequences were first used by Heinz Prüfer to prove Cayley's formula in 1918.".
- Prüfer_sequence label "Prüfer sequence".
- Prüfer_sequence sameAs Q1087829.
- Prüfer_sequence sameAs Prüfer-kode.
- Prüfer_sequence sameAs Prüfer-Code.
- Prüfer_sequence sameAs Secuencia_de_Prüfer.
- Prüfer_sequence sameAs پروفر_کد.
- Prüfer_sequence sameAs Codage_de_Prüfer.
- Prüfer_sequence sameAs קוד_פרופר.
- Prüfer_sequence sameAs Prüfer-kód.
- Prüfer_sequence sameAs Kod_Prüfera.
- Prüfer_sequence sameAs m.05kmwr.
- Prüfer_sequence sameAs Пруферова_секвенца.
- Prüfer_sequence sameAs Prüfersekvens.
- Prüfer_sequence sameAs ลำดับพรือเฟอร์.
- Prüfer_sequence sameAs Chuỗi_Prüfer.
- Prüfer_sequence sameAs Q1087829.
- Prüfer_sequence sameAs 普吕弗序列.
- Prüfer_sequence wasDerivedFrom Prüfer_sequence?oldid=702520238.
- Prüfer_sequence depiction Tree_graph.svg.
- Prüfer_sequence isPrimaryTopicOf Prüfer_sequence.
