{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **Tutte path** is a [[path|03NAMV1DHJ]] $P$ within a graph $G$ such that every connected component that remains after removing the vertices of $P$ from $G$ is connected back to $P$ at a limited number of vertices.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "KXMQPAR9H8"
    ],
    "kind": "concept",
    "name": "Tutte path",
    "same_as": {
      "wikidata": "Q135688778",
      "wikipedia": "Tutte path"
    },
    "sources": [
      {
        "locator": "Tutte path",
        "mention": "wikipedia://en/80543180",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:80543180@r1354665512"
      }
    ],
    "tag": "3JPXYKE8EE"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/3JPXYKE8EE/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/3JPXYKE8EE.md",
  "msc": null,
  "name": "Tutte path",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/3JP/3JPXYKE8EE.md",
  "status": null,
  "tag": "3JPXYKE8EE",
  "uri": "m2://3JPXYKE8EE",
  "url": "https://math2.tamnd.com/wiki/tutte-path/",
  "writing": {
    "tag": "3JPXYKE8EE",
    "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
      }
    ]
  }
}