The geometric thickness of low degree graphs

Christian Alexander Duncan, David Eppstein, and Stephen G. Kobourov
Proc. 20th Symp. Computational Geometry, ACM, 2004, pp. 340–346
ACM Computing Research Repository, cs.CG/0312056

Cited by:

• Really straight graph drawings
• Track layouts of graphs
• Graph treewidth and geometric thickness parameters
• Simultaneous embedding of planar graphs with few bends
• Bounded-degree graphs have arbitrarily large geometric thickness
• Two trees which are self-intersecting when drawn simultaneously