# David Eppstein - Publications

##

**Geometric thickness of complete graphs**.

M. Dillencourt,
D. Eppstein, and
D. S. Hirschberg.

*6th Int. Symp. Graph Drawing,*
Montreal, August 1998.

Springer, *Lecture Notes in
Comp. Sci.* 1547, 1998, pp. 102–110.

arXiv:math.CO/9910185.

*J. Graph
Algorithms and Applications* 4 (3): 5–17, 2000
(special issue for GD98).
We define a notion of geometric thickness, intermediate between the
previously studied concepts of graph thickness and book thickness: a
graph has geometric thickness T if its vertices can be embedded in the
plane, and its edges partitioned into T subsets, so that each subset
forms a planar straight line graph. We then give upper and lower bounds
on the geometric thickness of complete graphs.

Publications –
David Eppstein –
Theory Group –
Inf. & Comp. Sci. –
UC Irvine

Semi-automatically filtered
from a common source file.