1. Hamilton circuits in the comparability graph of a tree;Arditti,1969
2. Tough graphs and hamiltonian circuits;Chvátal;Discrete Math.,1973
3. Verallgemeinerung eines graphentheoretischen Satzes von Redei;Gallai;Acta Sci. Math. Szeged,1960
4. Caractérisation des graphes non orientes dont on peut orienter les arètes de maniere a obtenir le graphe d'une relation d'ordre;Ghouila-Houri;C. R. Acad. Sci. Paris,1962
5. A characterization of comparability graphs and of interval graphs;Gilmore;Canad. J. Math.,1964