Embedding planar graphs on the grid

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 138-148

  Schnyder, Walter ^a  

^a WESLEYAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PLANAR GRAPH; PLANE GRAPHS; VERTEX COORDINATES;

ALGORITHMS;

EID: 84962950301     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. CP M. Chrobak and T. H. Payne, A Linear-time Algorithm for Drawing a Planar Graph on a Grid, Manuscript, University of California at Riverside (1988).
2. F I. Fary, On straight line representation of planar graphs, Acta Sci. Math. Szeged 11(1948), 229-233.
3. FPP H. de Fraysseix, J. Pach, R. Pollack, Small sets supporting Fdry embeddings of planar graphs, Proc. 20th Ann. ACM Symp. on Theory of Computing (1988), 426-433.
4. K G. R. Kampen, Orienting Planar Graphs, Discrete Mathematics 14(1976), 337-341.
5. R R. C. Read, A new method for drawing a planar graph given the cyclic order of the edges at each vertex, Congressus Nurnerantium 56(1987), 31-44.
6. RT P. Rosenstiehl, R. E. Tarjan, Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs, Disc. Comp. Geom. 1(1986), 343-353.
7. Sc W. Schnyder, Planar graphs and poset dimension, Order 5(1989), 323-343.
8. St S. K. Stein, Convex maps, Proc. Amer. Math.. Soc. 2(1951), 464-466.
9. W K. Wagner, Bemerkungen zum Vierfarbenproblem, Jahresbericht. Deutsch. Math.-Verein. 46(1936), 26-32.