Representing an ordered set as the intersection of super greedy linear extensions
From MaRDI portal
Recommendations
Cites work
- Greedy linear extensions with constraints
- scientific article; zbMATH DE number 4168729 (Why is no real title available?)
- scientific article; zbMATH DE number 3786844 (Why is no real title available?)
- scientific article; zbMATH DE number 3318560 (Why is no real title available?)
- Inequalities for the greedy dimensions of ordered sets
- Inequalities in Dimension Theory for Posets
- NP-completeness results concerning greedy and super greedy linear extensions
- On the greedy dimension of a partial order
Cited in
(5)- Constructing greedy linear extensions by interchanging chains
- NP-completeness results concerning greedy and super greedy linear extensions
- Planar posets, dimension, breadth and the number of minimal elements
- scientific article; zbMATH DE number 4168729 (Why is no real title available?)
- On the greedy dimension of a partial order
This page was built for publication: Representing an ordered set as the intersection of super greedy linear extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104948)