Geometric thickness of complete graphs

Michael B. Dillencourt, David Eppstein, and Daniel S. Hirschberg
Proc. 6th Int. Symp. Graph Drawing (GD 1998), Lecture Notes in Computer Science 1547, Sue Whitesides, ed., Springer-Verlag, Aug 1998, pp. 102–110
J. Graph Algorithms & Applications 4(3):5–17, 2000
arXiv.org e-Print archive, math.CO/9910185
Mathematical Reviews 2000g:68118
Mathematical Reviews 2004f:05044

Cited by:

• Planarizing graphs — a survey and annotated bibliography
• Geometric thickness in a grid of linear area
• On simultaneous planar graph embeddings
• Stacks, queues and tracks: layouts of graph subdivisions
• Really straight graph drawings
• Track layouts of graphs
• Graph treewidth and geometric thickness parameters
• An interactive multi-user system for simultaneous graph drawing
• Simultaneous embedding of planar graphs with few bends
• Partitions of complete geometric graphs into plane trees
• Bounded-degree graphs have arbitrarily large geometric thickness