On some complexity properties of N-free posets and posets with bounded decomposition diameter
- 31 December 1987
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 63 (2-3) , 157-182
- https://doi.org/10.1016/0012-365x(87)90006-9
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- N-free posets as generalizations of series-parallel posetsDiscrete Applied Mathematics, 1985
- A Construction for Strongly Greedy Ordered SetsPublished by Springer Nature ,1984
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- Minimizing Setups for Ordered Sets: A Linear Algebraic ApproachSIAM Journal on Algebraic Discrete Methods, 1983
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- The Jump Number of Dags and Posets: An IntroductionPublished by Elsevier ,1980
- On the X-join decomposition for undirected graphsDiscrete Applied Mathematics, 1979
- Maximal chains and antichainsFundamenta Mathematicae, 1969
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- Partially Ordered SetsAmerican Journal of Mathematics, 1941