{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a subfield of mathematics, a **well-colored graph** is an undirected graph for which greedy coloring uses the same number of colors regardless of the order in which colors are chosen for its vertices. That is, for these graphs, the chromatic number (minimum number of colors) and Grundy number (maximum number of greedily-chosen colors) are equal.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "7WA08KJ890"
    ],
    "kind": "concept",
    "name": "Well-colored graph",
    "same_as": {
      "wikidata": "Q65079847",
      "wikipedia": "Well-colored graph"
    },
    "sources": [
      {
        "locator": "Well-colored graph",
        "mention": "wikipedia://en/60128175",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:60128175@r1367800103"
      }
    ],
    "tag": "833G605PM2"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/833G605PM2/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/833G605PM2.md",
  "msc": null,
  "name": "Well-colored graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/833/833G605PM2.md",
  "status": null,
  "tag": "833G605PM2",
  "uri": "m2://833G605PM2",
  "url": "https://math2.tamnd.com/wiki/well-colored-graph/",
  "writing": {
    "tag": "833G605PM2",
    "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
      }
    ]
  }
}