11453

# 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.

### DETAILS

References
[1] Christian A. Duncan, David Eppstein and Stephen G. Kobourov, "The Geometric Thickness of Low Degree Graphs", 24 Dec 2003. http://arxiv.org/abs/cs/0312056.
[2] D. Eppstein. "The Geometry Junkyard: Layered Graph Drawing." (Sep 18, 2015) www.ics.uci.edu/~eppstein/junkyard/thickness.
[3] Wikipedia. "Thickness (Graph Theory)." (Sep 18, 2015) en.wikipedia.org/wiki/Thickness_(graph_theory).

### PERMANENT CITATION

 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 » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.