{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "090WPKFABX"
    }
  ],
  "body": "\n## Summary\n\nA Hamiltonian graph is a graph that has a cycle through all of its vertices. There is no simple test for this property, but degree conditions give sufficient criteria. The node [[Hamiltonian graph|090WPKFABX]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C45"
    ],
    "name": "Hamiltonian graph",
    "sources": [
      {
        "locator": "Definitions",
        "url": "https://en.wikipedia.org/wiki/Hamiltonian_path"
      }
    ],
    "tag": "0HYV2NME07"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0HYV2NME07/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0HYV2NME07.md",
  "msc": [
    "05C45"
  ],
  "name": "Hamiltonian graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0HY/0HYV2NME07.md",
  "status": null,
  "tag": "0HYV2NME07",
  "uri": "m2://0HYV2NME07",
  "url": "https://math2.tamnd.com/wiki/hamiltonian-graph/",
  "writing": {
    "tag": "0HYV2NME07",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}