Thickness (graph theory)

In graph theory, the **thickness** of a graph is a measure of how "thick" or "layered" the graph can be drawn in a plane without edges crossing. More formally, the thickness of a graph is defined as the smallest number of planar subgraphs into which the edges of the graph can be partitioned. To clarify: - A **planar graph** is a graph that can be drawn on a plane without any edges crossing.