Grid drawings of 4-connected plane graphs

Discrete and Computational Geometry

Volumn 26, Issue 1, 2001, Pages 73-87

  Miura, K ^a   Nakano, S ^b   Nishizeki, T ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035644931     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0004-4     Document Type: Article

References (17)

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Automatic graph drawing: an annotated bibliography. Computational Geometry: Theory and Applications, 4 (1994), 235-282.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing. Prentice-Hall, Englewood Cliffs, NJ, 1998.
3. N. Chiba, K. Onoguchi, and T. Nishizeki, Drawing planar graphs nicely. Acta Informatica, 22 (1985), 187-201.
4. N. Chiba, T. Yamanouchi, and T. Nishizeki, Linear algorithms for convex drawings of planar graphs. In Progress in Graph Theory, J. A. Bondy and U. S. R. Murty (eds.), pp. 153-173. Academic Press, New York, 1984.
5. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications, 7 (1997), 211-223.
6. M. Chrobak and S. Nakano, Minimum-width grid drawings of plane graphs. Computational Geometry: Theory and Applications, 10 (1998), 29-54.
7. M. Chrobak and T. Payne, A linear-time algorithm for drawing planar graphs on a grid. Information Processing Letters, 54 (1995), 241-246.
8. I. Fáry. On straight lines representation of plane graphs. Acta Scientiarum Mathematicarum (Szeged), 11 (1948), 229-233.
9. H. de Fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid. Combinatorial, 10 (1990), 41-51.
10. X. He, Grid embedding of 4-connected plane graphs. Discrete & Computational Geometry, 17 (1997), 339-358.
11. G. Kant, Drawing planar graphs using the canonical ordering. Algorithmica, 16 (1996), 4-32.
12. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science, 172 (1997), 175-193.
13. K. Miura, S. Nakano, and T. Nishizeki, Grid drawings of four-connected plane graphs. Proceedings of Graph Drawing '99 (GD '99), Lecture Notes in Computer Science, 1731. Springer-Verlag, Berlin, 1999. pp. 145-154.
14. W. Schnyder, Embedding planar graphs on the grid. Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pp. 138-148.
15. S. K. Stein, Convex maps. Proceedings of the American Mathematical Society, 2 (1951), 464-466.
16. W. T. Tutte, How to draw a graph. Proceedings of the London Mathematical Society, 13 (1963), 743-768.
17. K. Wagner, Bemerkungen zum vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46 (1936), 26-32.