Drawing plane graphs nicely
- 1 June 1985
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (2) , 187-201
- https://doi.org/10.1007/bf00264230
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The complexity of drawing trees nicelyActa Informatica, 1983
- Tidier Drawings of TreesIEEE Transactions on Software Engineering, 1981
- Planarity and duality of finite and infinite graphsJournal of Combinatorial Theory, Series B, 1980
- Pretty-printing of treesSoftware: Practice and Experience, 1980
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- How to Draw a GraphProceedings of the London Mathematical Society, 1963
- Convex Representations of GraphsProceedings of the London Mathematical Society, 1960