Another note on Dilworth's decomposition theorem.

DOI10.1155/2013/692645zbMath1303.06001OpenAlexW2047617069WikidataQ58920011 ScholiaQ58920011MaRDI QIDQ2249932

Rob Potharst, Wim Pijls

Publication date: 4 July 2014

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

Full work available at URL: https://doi.org/10.1155/2013/692645

zbMATH Keywords

posetsmaximal antichainsDilworth decomposition theoremminimal path covers

Mathematics Subject Classification ID

Partial orders, general (06A06) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing on-line the lattice of maximal antichains of posets
• Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
• Recognition algorithms for orders of small width and graphs of small Dilworth number
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Sequential and parallel algorithms for minimum flows.
• A proof of Dilworth's decomposition theorem for partially ordered sets
• A decomposition theorem for partially ordered sets
• Optimal monotone relabelling of partially non-monotone ordinal data
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• A Proof of Dilworth's Chain Decomposition Theorem
• On Dilworth's decomposition theorem for partially ordered sets

This page was built for publication: Another note on Dilworth's decomposition theorem.