{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, **trapezoid graphs** are intersection graphs of trapezoids between two horizontal lines. They are a class of co-comparability graphs that contain interval graphs and permutation graphs as subclasses. A graph is a **trapezoid graph** if there exists a set of trapezoids corresponding to the vertices of the graph such that two vertices are joined by an edge if and only if the corresponding trapezoids intersect. Trapezoid graphs were introduced by Dagan, Golumbic, and Pinter in 1988. There exists ${O}(n\\log n)$ algorithms for chromatic number, weighted [[independent set|08ANQHHG3P]], clique cover, and maximum weighted clique.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "VFWC1EAED9"
    ],
    "kind": "concept",
    "name": "Trapezoid graph",
    "same_as": {
      "wikidata": "Q7835582",
      "wikipedia": "Trapezoid graph"
    },
    "sources": [
      {
        "locator": "Trapezoid graph",
        "mention": "wikipedia://en/31675608",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:31675608@r1365289064"
      }
    ],
    "tag": "8CBQ3NEPBM"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/8CBQ3NEPBM/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/8CBQ3NEPBM.md",
  "msc": null,
  "name": "Trapezoid graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/8CB/8CBQ3NEPBM.md",
  "status": null,
  "tag": "8CBQ3NEPBM",
  "uri": "m2://8CBQ3NEPBM",
  "url": "https://math2.tamnd.com/wiki/trapezoid-graph/",
  "writing": {
    "tag": "8CBQ3NEPBM",
    "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
      }
    ]
  }
}