Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Published 1999-11-01Version 1
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straight-line edges and assign each edge to a layer so that no two edges on the same layer cross. The geometric thickness lies between two previously studied quantities, the (graph-theoretical) thickness and the book thickness. We investigate the geometric thickness of the family of complete graphs, K_n. We show that the geometric thickness of K_n lies between ceiling((n/5.646) + 0.342) and ceiling(n/4), and we give exact values of the geometric thickness of K_n for n <= 12 and n in {15,16}. We also consider the geometric thickness of the family of complete bipartite graphs. In particular, we show that, unlike the case of complete graphs, there are complete bipartite graphs with arbitrarily large numbers of vertices for which the geometric thickness coincides with the standard graph-theoretical thickness.
Comments: 11 pages, 3 figures. A preliminary version of this paper appeared in the Sixth Symposium on Graph Drawing, GD '98, (Montr\'eal, Canada, August 1998), Springer-Verlag Lecture Notes in Computer Science 1547, 102--110
Journal: J. Graph Algorithms & Applications 4(3):5-17, 2000
Classification of nonorientable regular embeddings of complete bipartite graphs
The circular $k$-partite crossing number of $K_{m,n}$
Regular embeddings of complete bipartite graphs: classification and enumeration
![QR code for arXiv:math/9910185 [math.CO]](http://oss.arxitics.com/images/favicon.svg)