Recommendations
Cites work
- scientific article; zbMATH DE number 3860892 (Why is no real title available?)
- scientific article; zbMATH DE number 3786844 (Why is no real title available?)
- scientific article; zbMATH DE number 3641455 (Why is no real title available?)
- scientific article; zbMATH DE number 3318560 (Why is no real title available?)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Optimal Linear Extensions by Interchanging Chains
- Partially Ordered Sets
- Planar Lattices
- The Complexity of the Partial Order Dimension Problem
- The Dimension of a Comparability Graph
- The rank of a distributive lattice
Cited in
(11)- Representing an ordered set as the intersection of super greedy linear extensions
- Inequalities for the greedy dimensions of ordered sets
- scientific article; zbMATH DE number 3860892 (Why is no real title available?)
- On the power of graph searching for cocomparability graphs
- scientific article; zbMATH DE number 822739 (Why is no real title available?)
- Greedy linear extensions with constraints
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
- scientific article; zbMATH DE number 4016962 (Why is no real title available?)
- scientific article; zbMATH DE number 4168729 (Why is no real title available?)
- Greedy balanced pairs in \(N\)-free ordered sets
- A strict partial order on payoff configurations and its some properties
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)
