{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "0NACHJYPKW"
    },
    {
      "field": "uses",
      "target": "0TC99BRSSB"
    }
  ],
  "body": "\n## Definition\n\nA [[graph|0JD5C82QMB]] is Hamiltonian if it has a [[Hamiltonian cycle|0HKXNG2RS1]].\n\n## Remarks\n\nThe [[cycle graph|0QQ0F12962]] $C_n$ and the [[complete graph|03WKB2H474]] $K_n$ for $n \\ge 3$ are Hamiltonian.\nA [[tree|0MJ0JS72DZ]] is not Hamiltonian, because it has no cycle.\nThe [[Petersen graph|0NR95CTFCZ]] is not Hamiltonian.\n[[Dirac's theorem|0TC99BRSSB]] and [[Ore's theorem|0NACHJYPKW]] give sufficient conditions in terms of degrees.\n\n## Explanations\n\n### L1 human\n\nA graph is Hamiltonian when you can visit all of its vertices in one round trip, each vertex once.\nMany edges make this easier, and this is the idea of the theorems of Dirac and Ore.\n",
  "commit": "4da93a4f525f10adcd3643fb06f785669846f797",
  "front": {
    "defines": "0HYV2NME07",
    "inventory": [
      "YPA2K78CAS"
    ],
    "kind": "definition",
    "msc": [
      "05C45"
    ],
    "name": "Hamiltonian graph",
    "sources": [
      {
        "locator": "Definitions",
        "url": "https://en.wikipedia.org/wiki/Hamiltonian_path"
      }
    ],
    "tag": "090WPKFABX",
    "uses": [
      "0HKXNG2RS1"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/090WPKFABX/",
  "links": [
    {
      "field": "defines",
      "target": "0HYV2NME07"
    },
    {
      "field": "uses",
      "target": "0HKXNG2RS1"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/090WPKFABX.md",
  "msc": [
    "05C45"
  ],
  "name": "Hamiltonian graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/090/090WPKFABX.md",
  "status": null,
  "tag": "090WPKFABX",
  "uri": "m2://090WPKFABX",
  "url": "https://math2.tamnd.com/wiki/hamiltonian-graph-definition/",
  "writing": {
    "tag": "090WPKFABX",
    "kind": "definition",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "one example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge not_instance_of in",
        "note": "one non-example that fails one clause",
        "have": 0,
        "want": 1
      }
    ]
  }
}