1. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity usingPQ-tree algorithms,J. Comput. System Sci. 13 (1976), 335–379.
2. Technical Report;M. H. Brown,1984
3. N. Chiba, T. Yamanouchi, and T. Nishizeki, Linear algorithms for convex drawings of planar graphs,Proceedings of the Silver Jubilee Conference on Combinatorics, 1982, University of Waterloo, Waterloo, Ontario, to appear.
4. R. Cori and J. Hardouin-Duparc, Manipulation des cartes planaires à partir de leur codage, Département de Mathématiques, Université de Bordeaux, Talence, France, 1975.
5. P. Duchet, Y. Hamidoune, M. Las Vergnas, and H. Meyniel, Representing a planar graph by vertical lines joining different intervals,Discrete Math. 46 (1983), 319–321.