1. A. Bouchet. Etude combinatoire des ordonnés finis. Applications, Thèse, Grenoble (1971).
2. Aggregation of inequalities in integer programming;Chvátal;Ann. Discrete Math.,1977
3. O. Cogis. Ferrers digraphs and threshold graphs, Rap. Rech. No. 13, Gr. Rech. CNRS No. 22, Université P. et M. Curie, Paris (1979).
4. O. Cogis. Une caractérisation des graphes orientés de dimension 2, Rap. Rech. No. 19, Gr. Rech. CNRS No. 22, Université P. et M. Curie, Paris (1979).
5. T. Ibaraki, U.N. Peled. Sufficient conditions for graphs with threshold number 2, Dept. of Combinatorics and Optimization, University of Waterloo, CORR 78–13 (1978).