Publisher
Springer Berlin Heidelberg
Reference5 articles.
1. M. Habib (1985) Problem 4.2, in Algorithms and Order (ed. I. Rival), Kluwer Acad. Publ., Dordrecht, pp. 481.
2. H. A. Kierstead (1986) NP-completeness results concerning greedy and super greedy linear extensions, Order 3, 123–134.
3. H. A. Kierstead and W. T. Trotter (198) Super-greedy linear extensions of ordered sets, Annals New York Acad. Sci., 262–271.
4. H. A. Kierstead and W. T. Trotter (1989) The number of depth-first searches of an ordered set, Order 6, 295–303.
5. I. Rival (1984) Linear extensions of finite ordered sets, Annals Discrete Math. 23, 355–370.