1. Auslander, L., Parter, S.V.: On imbedding graphs in the plane. Journal of Mathematics and Mechanics 10, 517–523 (1961)
2. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ–tree algorithms. Journal of Computer and Systems Sciences 13, 335–379 (1976)
3. Lecture Notes in Computer Science;J.M. Boyer,2004
4. Boyer, J.M., Myrvold, W.: On the cutting edge: Simplified O(n) planarity by edge addition, p. 29 (preprint)
5. Boyer, J.M., Myrvold, W.: Stop minding your P’s and Q’s: A simplified O(n) planar embedding algorithm. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 140–146 (1999)