1. Lecture Notes in Computer Science;N. Bonichon,2003
2. Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. of the 12th Annual ACM-SIAM SODA, pp. 506–515. ACM Press, New York (2001)
3. Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive Reporting of Disjoint Paths. Algorithmica 23(4), 302–340 (1999)
4. Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs (Proc. of an International Symposium, Rome,July 1966), Rome, pp. 215–232 (1967)
5. de Mendez, P.O.: Orientations bipolaires. PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)