In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the...

school in Cape Town Herschel Grammar School, in Slough, Berkshire, England Herschel graph, a bipartite undirected graph Herschel Greer Stadium, in Nashville...

John Herschel, he did pioneering work in meteor spectroscopy. He also worked on identifying comets as the source of meteor showers. The Herschel graph, the...

18-edge Herschel graph, and there also exists an 11-vertex non-Hamiltonian polyhedral graph in which all faces are triangles, the Goldner–Harary graph. More...

base, and 4 kite and 4 triangle faces. The Herschel graph represents the vertices and edges of the Herschel enneahedron above, with all of its faces quadrilaterals...

Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton...

the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly...

given by the medial graph of the Herschel graph. Unsolved problem in mathematics: Does every prism over a 3-connected 3-regular graph have a Hamiltonian...

smaller non-Hamiltonian polyhedral graphs are possible, including the Goldner–Harary graph and the Herschel graph. Holton, D. A.; McKay, B. D. (1988)...

is 11. Therefore, the Goldner–Harary graph is a minimal example of graphs of this type. However, the Herschel graph, another non-Hamiltonian polyhedron...