The geometric thickness of low degree graphs

We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for graphs with maximum degree three and a more complex algorithm for embedding a graph with maximum degree four. The results have implications in graph theory, graph drawing, and VLSI design.

• Type: Conference
• Year: 2004
• Where: COMPGEOM
• Authors: Christian A. Duncan, David Eppstein, Stephen G. Kobourov
• Keywords: COMPGEOM 2004, Efficient Embedding Technique, Geometric Thickness, Maximum Degree