1.

A. V.Aho, J. E.Hopcroft, and J. D.Ullman (1974) *The Design and Analysis of Computer Algorithms*, Addison-Wesley, Reading, MA.

2.

V.Bouchitte and M.Habib (1989) The Calculation of Invariants for Ordered Sets, in *Algorithms and Order*, ed. I.Rival, Kluwer, Dordrecht, pp. 231–279.

3.

P.Buneman (1974) A Characterization of Rigid Circuit Graphs, *Discrete Math.*
**9**, 205–212.

4.

D. Coppersmith and S. Winograd (1987) Matrix Multiplication via Arithmetic Progressions, *Proceedings of the 19th Annual IEEE Symposium on the Foundations of Computer Science*, 1–6.

5.

B.Dushnick and E. W.Miller (1941) Partially Ordered Sets, *Amer. J. Math.*
**63**, 600–610.

6.

D.Duffus, I.Rival and P.Winkler (1982), Minimizing Setups for Cycle-Free Ordered Sets, *Proc. Amer. Math. Soc.*
**85**, 509–513.

7.

M. C.Golumbic (1980) *Algorithmic Graph Theory and Perfect Graphs*, Academic Press, New York.

8.

R. H.Möhring (1989) Computationally Tractable Classes of Ordered Sets, in *Algorithms and Order*, ed. I.Rival, Kluwer, Dordrecht, pp. 105–194.

9.

W. R. Pulleyblank (1982) Alternating Cycle-Free Matchings, *CORR Report* 82-18, Department of Combinatorics and Optimization, University of Waterloo.

10.

J. Qin and W. T. Trotter (1990) personal communication.

11.

D. J.Rose, R. E.Tarjan, and G. S.Leuker (1976) Algorithmic Aspects of Vertex Elimination on Graphs, *SIAM J. Computing*
**5**, 266–283.

12.

J.Spinrad (1985) On Comparability and Permutation Graphs, *SIAM J. of Computing*
**14**, 658–670.

13.

W. T.Trotter and J. I.Moore (1977) The Dimension of Planar Posets, *Journal of Combinatorial Theory Series B*
**22**, 54–67.

14.

R. E.Tarjan and M.Yannakakis (1984) Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, *SIAM J. of Computing*
**23**, 566–579.