REFERENCES 619
[FPP88] H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary
embeddings of planar graphs. In Twentieth Annual ACM Symposium
on Theory of Computing, pages 426–433, 1988.
[FPP90] H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph
on a grid. Combinatorica, 10:41–51, 1990.
[FR82] H. de Fraysseix and P. Rosenstiehl. A depth-first search characterization
of planarity. Annals of Discrete Mathematics, 13:75–80, 1982.
[FR83a] H. de Fraysseix and P. Rosenstiehl. A discriminatory theorem of Kura-
towski subgraphs. In J. W. Kennedy, M. Borowiecki, and M. M. Sys lo,
editors, Graph Theory, Lag´ow 1981, volume 1018 of Lecture Notes in
Mathematics, pages 214–222. Springer-Verlag, 1983. Conference dedi-
cated to the memory ...