{
  "aliases": [
    "path-decomposition",
    "path-width"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **path decomposition** of a [[graph|00C0BR7D7H]] $G$ is, informally, a representation of $G$ as a \"thickened\" [[path graph|075WR6W3Y3]], and the **pathwidth** of $G$ is a number that measures how much the path was thickened to form $G$. More formally, a path-decomposition is a sequence of [[subsets|0BJR9QR08E]] of vertices of $G$ such that the endpoints of each edge appear in one of the subsets and such that each vertex appears in a contiguous [[subsequence|0F1PR74BRX]] of the subsets, and the pathwidth is one less than the size of the largest set in such a decomposition. Pathwidth is also known as **interval thickness** (one less than the maximum clique size in an interval supergraph of $G$), **vertex separation number**, or **node searching number**.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "path-decomposition",
      "path-width"
    ],
    "inventory": [
      "35FFR7E7XJ"
    ],
    "kind": "concept",
    "name": "Pathwidth",
    "same_as": {
      "wikidata": "Q7144893",
      "wikipedia": "Pathwidth"
    },
    "sources": [
      {
        "locator": "Pathwidth",
        "mention": "wikipedia://en/5133142",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:5133142@r1369812266"
      }
    ],
    "tag": "YDEKMEQF90"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/YDEKMEQF90/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/YDEKMEQF90.md",
  "msc": null,
  "name": "Pathwidth",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/YDE/YDEKMEQF90.md",
  "status": null,
  "tag": "YDEKMEQF90",
  "uri": "m2://YDEKMEQF90",
  "url": "https://math2.tamnd.com/wiki/pathwidth/",
  "writing": {
    "tag": "YDEKMEQF90",
    "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
      }
    ]
  }
}