Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
2. Kant, G.: A more compact visibility representation. International Journal of Computational Geometry and Applications 7, 197–210 (1997)
3. Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science 172, 175–193 (1997)
4. Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs, Rome, pp. 215–232 (1967)
5. Lecture Notes in Computer Science;C.-C. Lin,2003
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献