Compton, Kevin J. The computational complexity of asymptotic problems. I: Partial orders. (English) Zbl 0665.03028 Inf. Comput. 78, No. 2, 108-123 (1988). MSC: 03D15 03B10 03B48 06A06 PDFBibTeX XMLCite \textit{K. J. Compton}, Inf. Comput. 78, No. 2, 108--123 (1988; Zbl 0665.03028) Full Text: DOI
Möhring, Rolf H. Almost all comparability graphs are UPO. (English) Zbl 0543.05054 Discrete Math. 50, 63-70 (1984). Reviewer: D.Kleitman MSC: 05C99 05C75 06A06 PDFBibTeX XMLCite \textit{R. H. Möhring}, Discrete Math. 50, 63--70 (1984; Zbl 0543.05054) Full Text: DOI