"polygon-circle graph" meaning in All languages combined

{
  "forms": [
    {
      "form": "polygon-circle graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "polygon-circle graph (plural polygon-circle graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2004, Jan Kratochvíl, Martin Pergel, “Two Results on Intersection Graphs of Polygons”, in Giuseppe Liotta, editor, GD 2003 International Symposium on Graph Drawing (Lecture Notes in Computer Science), volume 2912, Springer-Verlag, →DOI, page 60",
          "text": "A common generalization of these two [circle graphs and circular arc graphs] are polygon-circle graphs, intersection graphs of convex polygons inscribed to the circle. This class was first suggested by M. Fellows [personal communication with the first author] in 1988, when it was pointed out that this class of graphs is closed under taking induced minors.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A graph (set of connected points) in which each vertex corresponds to a convex polygon circumscribed in a common circle, and in which (graph) vertices are adjacent iff their corresponding polygons intersect geometrically."
      ],
      "id": "en-polygon-circle_graph-en-noun-g~XeJAIy",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "vertex",
          "vertex"
        ],
        [
          "convex",
          "convex"
        ],
        [
          "circumscribed",
          "circumscribe"
        ],
        [
          "iff",
          "iff"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph (set of connected points) in which each vertex corresponds to a convex polygon circumscribed in a common circle, and in which (graph) vertices are adjacent iff their corresponding polygons intersect geometrically."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "polygon-circle graph"
}

{
  "forms": [
    {
      "form": "polygon-circle graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "polygon-circle graph (plural polygon-circle graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "en:Graph theory"
      ],
      "examples": [
        {
          "ref": "2004, Jan Kratochvíl, Martin Pergel, “Two Results on Intersection Graphs of Polygons”, in Giuseppe Liotta, editor, GD 2003 International Symposium on Graph Drawing (Lecture Notes in Computer Science), volume 2912, Springer-Verlag, →DOI, page 60",
          "text": "A common generalization of these two [circle graphs and circular arc graphs] are polygon-circle graphs, intersection graphs of convex polygons inscribed to the circle. This class was first suggested by M. Fellows [personal communication with the first author] in 1988, when it was pointed out that this class of graphs is closed under taking induced minors.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A graph (set of connected points) in which each vertex corresponds to a convex polygon circumscribed in a common circle, and in which (graph) vertices are adjacent iff their corresponding polygons intersect geometrically."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "vertex",
          "vertex"
        ],
        [
          "convex",
          "convex"
        ],
        [
          "circumscribed",
          "circumscribe"
        ],
        [
          "iff",
          "iff"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph (set of connected points) in which each vertex corresponds to a convex polygon circumscribed in a common circle, and in which (graph) vertices are adjacent iff their corresponding polygons intersect geometrically."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "polygon-circle graph"
}