{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0NNYDD1AVR"
    },
    {
      "field": "instance_of",
      "target": "0YCW781Q9D"
    }
  ],
  "body": "\n## Summary\n\nAn Eulerian trail is a trail that uses every edge of a graph exactly once. The question of which graphs have one is the origin of graph theory. The node [[Eulerian trail|0NNYDD1AVR]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C45"
    ],
    "name": "Eulerian trail",
    "same_as": {
      "wikidata": "Q624580",
      "wikipedia": "Eulerian path"
    },
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Eulerian_path"
      }
    ],
    "tag": "05NWGBHKSZ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/05NWGBHKSZ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/05NWGBHKSZ.md",
  "msc": [
    "05C45"
  ],
  "name": "Eulerian trail",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/05N/05NWGBHKSZ.md",
  "status": null,
  "tag": "05NWGBHKSZ",
  "uri": "m2://05NWGBHKSZ",
  "url": "https://math2.tamnd.com/wiki/eulerian-trail/",
  "writing": {
    "tag": "05NWGBHKSZ",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 1,
        "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
      }
    ]
  }
}