{
  "aliases": [
    "charles-pierre-tremaux",
    "charles-tremaux",
    "normal-tree"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **Trémaux tree** of an undirected graph $G$ is a type of [[spanning tree|0FQ5B8S1ZC]], generalizing depth-first search trees. They are defined by the property that every edge of $G$ connects an ancestor–descendant pair in the tree. Trémaux trees are named after Charles Pierre Trémaux, a 19th-century French author who used a form of depth-first search as a strategy for solving mazes. They have also been called **normal spanning trees**, especially in the context of infinite graphs.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "charles-pierre-tremaux",
      "charles-tremaux",
      "normal-tree"
    ],
    "inventory": [
      "M0PTZNPN4J"
    ],
    "kind": "concept",
    "name": "Trémaux tree",
    "same_as": {
      "wikidata": "Q7849146",
      "wikipedia": "Trémaux tree"
    },
    "sources": [
      {
        "locator": "Trémaux tree",
        "mention": "wikipedia://en/30247317",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:30247317@r1375502672"
      }
    ],
    "tag": "6J20G0YPWH"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/6J20G0YPWH/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/6J20G0YPWH.md",
  "msc": null,
  "name": "Trémaux tree",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/6J2/6J20G0YPWH.md",
  "status": null,
  "tag": "6J20G0YPWH",
  "uri": "m2://6J20G0YPWH",
  "url": "https://math2.tamnd.com/wiki/tremaux-tree/",
  "writing": {
    "tag": "6J20G0YPWH",
    "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
      }
    ]
  }
}