multitree (Q6935120)

From Wikidata
Jump to navigation Jump to search
DAG in which the set of vertices reachable from any vertex induces a tree, or a poset 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
  • strongly unambiguous graph
  • mangrove
  • diamond-free poset
  • butterfly network
edit
Language Label Description Also known as
English
multitree
DAG in which the set of vertices reachable from any vertex induces a tree, or a poset 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
  • strongly unambiguous graph
  • mangrove
  • diamond-free poset
  • butterfly network

Statements

Identifiers

 
edit
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit