{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0C5M7AM6FH"
    }
  ],
  "body": "\n## Summary\n\nThe chromatic number of a graph is the least number of colours in a proper colouring. It is a central invariant of graph theory, and the four colour theorem bounds it for planar graphs. The node [[chromatic number|0C5M7AM6FH]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C15"
    ],
    "name": "Chromatic number",
    "sources": [
      {
        "locator": "Vertex coloring",
        "url": "https://en.wikipedia.org/wiki/Graph_coloring"
      }
    ],
    "tag": "0VHJRXNAAS"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0VHJRXNAAS/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0VHJRXNAAS.md",
  "msc": [
    "05C15"
  ],
  "name": "Chromatic number",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0VH/0VHJRXNAAS.md",
  "status": null,
  "tag": "0VHJRXNAAS",
  "uri": "m2://0VHJRXNAAS",
  "url": "https://math2.tamnd.com/wiki/chromatic-number/",
  "writing": {
    "tag": "0VHJRXNAAS",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}