{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nA cactus graph, cactus tree, cactus, or Husimi tree is a connected graph in which each edge belongs to at most one cycle. Its blocks are cycles or single edges. If, in addition, each vertex belongs to at most two blocks, then it is called a Christmas cactus.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "N4EXWN4R8T"
    ],
    "kind": "concept",
    "name": "Cactus",
    "sources": [
      {
        "locator": "Glossary of graph theory, section C",
        "mention": "wikipedia://en/325802#OT9R",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "DZE2XNC6JP"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/DZE2XNC6JP/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/DZE2XNC6JP.md",
  "msc": null,
  "name": "Cactus",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/DZE/DZE2XNC6JP.md",
  "status": null,
  "tag": "DZE2XNC6JP",
  "uri": "m2://DZE2XNC6JP",
  "url": "https://math2.tamnd.com/wiki/cactus/",
  "writing": {
    "tag": "DZE2XNC6JP",
    "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
      }
    ]
  }
}