On the greedy dimension of a partial order
From MaRDI portal
Publication:802583
DOI10.1007/BF00383597zbMATH Open0559.06003MaRDI QIDQ802583FDOQ802583
Authors: Vincent Bouchitté, M. A. Habib, Roland Jégou
Publication date: 1985
Published in: Order (Search for Journal in Brave)
Recommendations
Cites Work
- The Complexity of the Partial Order Dimension Problem
- Title not available (Why is that?)
- Partially Ordered Sets
- The rank of a distributive lattice
- Optimal Linear Extensions by Interchanging Chains
- Planar Lattices
- Title not available (Why is that?)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Title not available (Why is that?)
- The Dimension of a Comparability Graph
- Title not available (Why is that?)
Cited In (11)
- Greedy balanced pairs in \(N\)-free ordered sets
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
- Title not available (Why is that?)
- Greedy linear extensions with constraints
- On the power of graph searching for cocomparability graphs
- A strict partial order on payoff configurations and its some properties
- Title not available (Why is that?)
- Representing an ordered set as the intersection of super greedy linear extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inequalities for the greedy dimensions of ordered sets
This page was built for publication: On the greedy dimension of a partial order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802583)