Author:
Mäkinen Erkki,Poranen Timo
Publisher
University of Central Missouri, Department of Mathematics and Computer Science
Reference95 articles.
1. A. Aggarwal, M. Klawe, and P. Shor, Multilayer grid embeddings for VLSI, Algorithmica, 6.1 (1991), 129–151.
2. I. Aho, E. Mäkinen, and T. Systä, Remarks on the thickness of a graph, Information Sciences, 108 (1998), 1–4.
3. M. O. Albertson, D. Boutin, and E. Gethner, The thickness and chromatic number of r-inflated graphs, Discrete Mathematics, 310.20 (2010), 2725–2734.
4. V. B. Alekseev amd V. S. Gonchakov, Thickness for arbitrary complete graphs, Matematicheskij Sbornik, 143 (1976), 212–230.
5. K. Asano, On the genus and thickness of graphs, Journal of Combinatorial Theory Series B, 43 (1987), 287–292.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献