Mathematics – Combinatorics
Scientific paper
1999-11-01
J. Graph Algorithms & Applications 4(3):5-17, 2000
Mathematics
Combinatorics
11 pages, 3 figures. A preliminary version of this paper appeared in the Sixth Symposium on Graph Drawing, GD '98, (Montr\'eal
Scientific paper
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.
Dillencourt Michael B.
Eppstein David
Hirschberg Daniel S.
No associations
LandOfFree
Geometric Thickness of Complete Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Geometric Thickness of Complete Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric Thickness of Complete Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-714951