---
tag: KHCFM3Z0NB
kind: concept
name: Thickness (graph theory)
aliases: [biplanar-graph, graph-thickness]
sources:
  - wikipedia: en:43082178@r1374118628
    locator: Thickness (graph theory)
    note: adopted
    mention: wikipedia://en/43082178
    sections: [Summary]
same_as:
  wikidata: Q18394143
  wikipedia: Thickness (graph theory)
inventory: [TFNYPHRCWZ]
---

## Summary

In graph theory, the **thickness** of a graph $G$ is the minimum number of planar graphs into which the edges of $G$ can be partitioned. That is, if there exists a collection of $k$ planar graphs, all having the same set of vertices, such that the union of these planar graphs is $G$, then the thickness of $G$ is at most $k$. In other words, the thickness of a graph is the minimum number of planar subgraphs whose union equals to graph $G$.