{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematics of Sudoku, the **Sudoku graph** is an undirected graph whose vertices represent the cells of a (blank) Sudoku puzzle and whose edges represent pairs of cells that belong to the same row, column, or block of the puzzle. The problem of solving a Sudoku puzzle can be represented as precoloring extension on this graph. It is an integral [[Cayley graph|0GYQK9NDJF]].\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "VHBKMHEDEG"
    ],
    "kind": "concept",
    "name": "Sudoku graph",
    "same_as": {
      "wikidata": "Q62664144",
      "wikipedia": "Sudoku graph"
    },
    "sources": [
      {
        "locator": "Sudoku graph",
        "mention": "wikipedia://en/59925424",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:59925424@r1329657729"
      }
    ],
    "tag": "GZ69AGCJNJ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/GZ69AGCJNJ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/GZ69AGCJNJ.md",
  "msc": null,
  "name": "Sudoku graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/GZ6/GZ69AGCJNJ.md",
  "status": null,
  "tag": "GZ69AGCJNJ",
  "uri": "m2://GZ69AGCJNJ",
  "url": "https://math2.tamnd.com/wiki/sudoku-graph/",
  "writing": {
    "tag": "GZ69AGCJNJ",
    "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
      }
    ]
  }
}