{
  "aliases": [
    "biplanar-graph",
    "graph-thickness"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn 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$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "biplanar-graph",
      "graph-thickness"
    ],
    "inventory": [
      "TFNYPHRCWZ"
    ],
    "kind": "concept",
    "name": "Thickness (graph theory)",
    "same_as": {
      "wikidata": "Q18394143",
      "wikipedia": "Thickness (graph theory)"
    },
    "sources": [
      {
        "locator": "Thickness (graph theory)",
        "mention": "wikipedia://en/43082178",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:43082178@r1374118628"
      }
    ],
    "tag": "KHCFM3Z0NB"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/KHCFM3Z0NB/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/KHCFM3Z0NB.md",
  "msc": null,
  "name": "Thickness (graph theory)",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/KHC/KHCFM3Z0NB.md",
  "status": null,
  "tag": "KHCFM3Z0NB",
  "uri": "m2://KHCFM3Z0NB",
  "url": "https://math2.tamnd.com/wiki/thickness-graph-theory/",
  "writing": {
    "tag": "KHCFM3Z0NB",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}