The geometric thickness of low degree graphs

Christian A. Duncan, David Eppstein, Stephen G. Kobourov

Research output: Contribution to conferencePaperpeer-review

45 Scopus citations


We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for graphs with maximum degree three that uses an n × n grid and a more complex algorithm for embedding a graph with maximum degree four. We also show a variation using orthogonal edges for maximum degree four graphs that also uses an n × n grid. The results have implications in graph theory, graph drawing, and VLSI design.

Original languageEnglish (US)
Number of pages7
StatePublished - 2004
EventProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04) - Brooklyn, NY, United States
Duration: Jun 9 2004Jun 11 2004


OtherProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)
Country/TerritoryUnited States
CityBrooklyn, NY


  • Geometric thickness
  • Graph drawing
  • Graph thickness
  • Layered graphs
  • Rectangle visibility
  • Simultaneous embeddings

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'The geometric thickness of low degree graphs'. Together they form a unique fingerprint.

Cite this