Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Multitree> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- Multitree abstract "In combinatorics and order-theoretic mathematics, a multitree may describe either of two equivalent structures: a directed acyclic graph in which the set of nodes reachable from any node form a tree, or a partially ordered set that does not have four items a, b, c, and d forming a diamond suborder with a ≤ b ≤ d and a ≤ c ≤ d but with b and c incomparable to each other (also called a diamond-free poset).".
- Multitree thumbnail Butterfly_multitree.svg?width=300.
- Multitree wikiPageID "27131455".
- Multitree wikiPageRevisionID "562014286".
- Multitree hasPhotoCollection Multitree.
- Multitree subject Category:Directed_graphs.
- Multitree subject Category:Order_theory.
- Multitree type Abstraction100002137.
- Multitree type Communication100033020.
- Multitree type DirectedGraphs.
- Multitree type Graph107000195.
- Multitree type VisualCommunication106873252.
- Multitree comment "In combinatorics and order-theoretic mathematics, a multitree may describe either of two equivalent structures: a directed acyclic graph in which the set of nodes reachable from any node form a tree, or a partially ordered set that does not have four items a, b, c, and d forming a diamond suborder with a ≤ b ≤ d and a ≤ c ≤ d but with b and c incomparable to each other (also called a diamond-free poset).".
- Multitree label "Multitree".
- Multitree sameAs m.0dddng7.
- Multitree sameAs Q6935120.
- Multitree sameAs Q6935120.
- Multitree sameAs Multitree.
- Multitree wasDerivedFrom Multitree?oldid=562014286.
- Multitree depiction Butterfly_multitree.svg.
- Multitree isPrimaryTopicOf Multitree.
