Arbres et dimension des ordres

DOI10.1016/0012-365X(76)90007-8zbMath0318.06001MaRDI QIDQ1222175

Bruno Leclerc

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Enumeration in graph theory (05C30)

Related Items (4)

Maximum independent set and maximum clique algorithms for overlap graphs ⋮ Binary relations: Finite characterizations and computational complexity ⋮ Some theorems on graphs and posets ⋮ Characterization problems for graphs, partially ordered sets, lattices, and families of sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound on the dimension of interval orders
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
• Ordres "C.A.C."
• A NEW CHARACTERIZATION OF PARTIAL ORDERS OF DIMENSION TWO
• Partial orders of dimension 2
• Partially Ordered Sets

This page was built for publication: Arbres et dimension des ordres