{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "07CT9RDY7Q"
    }
  ],
  "body": "\n## Summary\n\nA cycle in a graph is a closed walk that visits each of its vertices once and returns to its start. Cycles are central in graph theory, for example in the definitions of trees and of bipartite graphs. The node [[cycle|07CT9RDY7Q]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C38"
    ],
    "name": "Cycle",
    "same_as": {
      "wikidata": "Q245595",
      "wikipedia": "Cycle (graph theory)"
    },
    "sources": [
      {
        "locator": "Circuit and cycle",
        "url": "https://en.wikipedia.org/wiki/Cycle_(graph_theory)"
      }
    ],
    "tag": "0Z05VCBQ7Y"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0Z05VCBQ7Y/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0Z05VCBQ7Y.md",
  "msc": [
    "05C38"
  ],
  "name": "Cycle",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0Z0/0Z05VCBQ7Y.md",
  "status": null,
  "tag": "0Z05VCBQ7Y",
  "uri": "m2://0Z05VCBQ7Y",
  "url": "https://math2.tamnd.com/wiki/cycle/",
  "writing": {
    "tag": "0Z05VCBQ7Y",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "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
      }
    ]
  }
}