Minimum decomposition of partially ordered sets into chains

DOI10.1007/BF01958601zbMath0297.90093MaRDI QIDQ4051928

No author found.

Publication date: 1975

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Cites Work

• Maximum internally stable sets of a graph
• A decomposition theorem for partially ordered sets
• A Dual of Dilworth's Decomposition Theorem
• Unnamed Item

This page was built for publication: Minimum decomposition of partially ordered sets into chains