Thickness-2 Graphs

If the edges of a graph can be partitioned into two planar graphs, it has thickness 2 (a biplanar graph). This Demonstration shows some thickness-2 embeddings of various quartic graphs. In the first step a Hamiltonian cycle is chosen. One of the graphs, the icosidodecahedral graph (26), is planar and actually has thickness 1.
Non-planar quartic graphs have geometric thickness 2 [1], and therefore have thickness 2.



  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


[1] Christian A. Duncan, David Eppstein and Stephen G. Kobourov, "The Geometric Thickness of Low Degree Graphs", 24 Dec 2003.
[2] D. Eppstein. "The Geometry Junkyard: Layered Graph Drawing." (Sep 18, 2015)
[3] Wikipedia. "Thickness (Graph Theory)." (Sep 18, 2015)
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.