On the greedy dimension of a partial order

DOI10.1007/BF00383597zbMath0559.06003MaRDI QIDQ802583

Roland Jégou, Michel A. Habib, Vincent Bouchitte

Publication date: 1985

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

linear extensionmaximal chainsfinite partially ordered setgreedy dimensiongreedy linear extensions

Mathematics Subject Classification ID

Partial orders, general (06A06)

Related Items

Representing an ordered set as the intersection of super greedy linear extensions, Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II, Greedy balanced pairs in \(N\)-free ordered sets, On the Power of Graph Searching for Cocomparability Graphs, Greedy linear extensions with constraints, Inequalities for the greedy dimensions of ordered sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• The rank of a distributive lattice
• The Complexity of the Partial Order Dimension Problem
• Optimal Linear Extensions by Interchanging Chains
• Planar Lattices
• The Dimension of a Comparability Graph
• Partially Ordered Sets