Chain partitions of ordered sets

DOI10.1007/BF01108766MaRDI QIDQ5917347zbMATH OpenFDO

Authors Zbigniew Lonc

Publication date 23 July 1995

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01108766

zbMATH Keywords

computational complexityordered setchain partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)

Recommendations

• scientific article; zbMATH DE number 219236
• Algorithms over partially ordered sets
• Problems on chain partitions
• scientific article; zbMATH DE number 67598
• Chain minors are FPT

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 219236 (Why is no real title available?)
• On the complexity of some edge-partition problems for graphs
• Packings by cliques and by finite families of graphs
• Proof of a conjecture on partitions of a Boolean lattice

Cited in

(9)

• scientific article; zbMATH DE number 67598 (Why is no real title available?)
• scientific article; zbMATH DE number 702028 (Why is no real title available?)
• Chains in the lattice of noncrossing partitions
• Saturated chain partitions in ranked partially ordered sets, and non-monotone symmetric 11-Venn diagrams
• scientific article; zbMATH DE number 3972869 (Why is no real title available?)
• Chain minors are FPT
• scientific article; zbMATH DE number 219236 (Why is no real title available?)
• Problems on chain partitions
• Chain partitions of products of two chains

This page was built for publication: Chain partitions of ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917347)