Publisher
Springer Nature Switzerland
Reference24 articles.
1. Alekseev, V.B., Gončakov, V.S.: The thickness of an arbitrary complete graph. Math. USSR-Sbornik 30(2), 187 (1976)
2. Beineke, L.W., Harary, F.: The thickness of the complete graph. Canadian J. Math. 17, 850–859 (1965)
3. Brandenburg, F.J.: Straight-line drawings of 1-planar graphs. arXiv preprint arXiv:2109.01692 (2021)
4. Cardinal, J., Kusters, V.: The complexity of simultaneous geometric graph embedding. J. Graph Algor. Appl. 19(1), 259–272 (2015)
5. Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algor. Appl. 4(3), 5–17 (2000)