"Herschel graph" meaning in All languages combined

{
  "etymology_text": "From Herschel (“a surname”) + graph, after British astronomer Alexander Stewart Herschel (1836—1907), who identified the associated polyhedron (an enneahedron) as one for which there is no solution to the icosian game.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Herschel graph",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "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"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1994, Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, page 587:",
          "text": "Select a suitable independent set / and use part (b) to show that the graph in Fig. 11.81 (known as the Herschel graph) has no Hamilton cycle.",
          "type": "quote"
        },
        {
          "ref": "2004, William Kocay, Donald L. Kreher, Graphs, Algorithms, and Optimization, page 202:",
          "text": "A bipartite graph like the Herschel graph of Figure 9.2 is also non-hamiltonian, but the algorithm is not likely to delete enough vertices to notice that it has a large separating set.",
          "type": "quote"
        },
        {
          "text": "2006, Michael S. Keane, Dee Denteneer, Frank Hollander, Evgeny Verbitskiy, Dynamics and Stochastics, Institute of Mathematical Statistics, Lecture Notes—Monograph Series, Volume 48, page 174,\nIt is difficult to control what loops may arise: for example the Herschel graph [3] shows that a convex polyhedron need not be Hamiltonian as a graph."
        }
      ],
      "glosses": [
        "A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph."
      ],
      "id": "en-Herschel_graph-en-name-TLNOUDny",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "graph theory",
          "graph theory"
        ],
        [
          "bipartite",
          "bipartite"
        ],
        [
          "undirected graph",
          "undirected graph"
        ],
        [
          "Hamiltonian",
          "Hamiltonian"
        ],
        [
          "polyhedral",
          "polyhedral"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics, graph theory) A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph."
      ],
      "synonyms": [
        {
          "sense": "smallest non-Hamiltonian polyhedral graph",
          "word": "Herschel's graph"
        }
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Alexander Stewart Herschel",
        "icosian game"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-æf"
    }
  ],
  "word": "Herschel graph"
}

{
  "etymology_text": "From Herschel (“a surname”) + graph, after British astronomer Alexander Stewart Herschel (1836—1907), who identified the associated polyhedron (an enneahedron) as one for which there is no solution to the icosian game.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Herschel graph",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "Quotation templates to be cleaned",
        "Rhymes:English/æf",
        "Rhymes:English/æf/3 syllables",
        "en:Graph theory",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "1994, Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, page 587:",
          "text": "Select a suitable independent set / and use part (b) to show that the graph in Fig. 11.81 (known as the Herschel graph) has no Hamilton cycle.",
          "type": "quote"
        },
        {
          "ref": "2004, William Kocay, Donald L. Kreher, Graphs, Algorithms, and Optimization, page 202:",
          "text": "A bipartite graph like the Herschel graph of Figure 9.2 is also non-hamiltonian, but the algorithm is not likely to delete enough vertices to notice that it has a large separating set.",
          "type": "quote"
        },
        {
          "text": "2006, Michael S. Keane, Dee Denteneer, Frank Hollander, Evgeny Verbitskiy, Dynamics and Stochastics, Institute of Mathematical Statistics, Lecture Notes—Monograph Series, Volume 48, page 174,\nIt is difficult to control what loops may arise: for example the Herschel graph [3] shows that a convex polyhedron need not be Hamiltonian as a graph."
        }
      ],
      "glosses": [
        "A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "graph theory",
          "graph theory"
        ],
        [
          "bipartite",
          "bipartite"
        ],
        [
          "undirected graph",
          "undirected graph"
        ],
        [
          "Hamiltonian",
          "Hamiltonian"
        ],
        [
          "polyhedral",
          "polyhedral"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics, graph theory) A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Alexander Stewart Herschel",
        "icosian game"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-æf"
    }
  ],
  "synonyms": [
    {
      "sense": "smallest non-Hamiltonian polyhedral graph",
      "word": "Herschel's graph"
    }
  ],
  "word": "Herschel graph"
}