Author:
Shahrokhi Farhad,Sýkora Ondrej,Székely László A.,Vrt’o Imrich
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. Multi-layer grid embeddings for VLSI;Aggarwal;Algorithmica,1991
2. Complete bipartite graphs: decomposition into planar subgraphs;Beineke,1967
3. On the thickness of the complete bipartite graphs;Beineke;Proc. Cambridge Philos. Soc.,1964
4. É. Czabarka, O. Sýkora, L.A. Székely, I. Vrt’o, Biplanar crossing numbers: a survey of results and problems, in: Györi, E., Katona, G.O.H., Lováz, L. (Eds.), More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies, vol. 15, Springer, Berlin, 2006, pp.57–77.
5. M. Dillencourt, D. Eppstein, D.S. Hirschberg, Geometric thickness of complete graphs, in: Proceedings of the Sixth International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol. 1547, Springer, Berlin, 1998, pp. 102–110.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献