Abstract
A diagram is an undirected graph corresponding to the covering relation of a finite poset. We prove that three decision problems related to diagrams are NP-complete.
AMS subject classification (1980)
06A10Key words
Poset diagram NP-completenessPreview
Unable to display preview. Download preview PDF.
References
- 1.M. Aigner (1982) Problem, in: Ordered Sets (ed. I. Rival), D. Reidel, Holland, p. 819.Google Scholar
- 2.P. Erdös (1959) Graph theory and probability, Canad. J. Math. 11, 34–38.Google Scholar
- 3.M. Garey and D. Johnson (1979) Computers and Intractability, W. H. Freeman Co., San Francisco.Google Scholar
- 4.P. Holub (1985) A remark on Hasse diagrams, Order 2, 321–322.Google Scholar
- 5.J. Nešetřil and V. Rödl (1978) A probabilistic graph-theoretical method, Proc. Amer. Math. Soc. 72, 417–421.Google Scholar
- 6.J. Nešetřil and V. Rödl (1984) Combinatorial partitions of finite lattices and posets — Ramsey lattices, Algebra Univ. 19, 106–119.Google Scholar
- 7.O. Ore (1984) Theory of graphs, Amer. Math. Soc. Coll. Publ. Google Scholar
- 8.Unsolved problems, Order 1 (dy1984), 103.Google Scholar
- 9.H. Sachs, Einführung in Graphentheorie II, Teubner, Leipzig.Google Scholar
Copyright information
© D. Reidel Publishing Company 1987