field of graph theory, the Goldner–Harary graph is a simple undirected graph with 11 vertices and 27 edges. It is named after Anita M. Goldner and Frank...

Frank Harary (March 11, 1921 – January 4, 2005) was an American mathematician, who specialized in graph theory. He was widely recognized as one of the...

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

vertices. The Goldner–Harary graph provides an example of a planar graph that does not have book thickness two: it is a maximal planar graph, so it is not...

triangles; the skeleton of the resulting polyhedron represents the Goldner–Harary graph. Another type of triangular bipyramid results from cutting off its...

maximal planar graph such as the Goldner–Harary graph cannot have a planar embedding with one semicircle per edge. Testing whether a given graph has a crossing-free...

non-Hamiltonian polyhedral graph. There exist other polyhedral graphs with 11 vertices and no Hamiltonian cycles (notably the Goldner–Harary graph) but none with...

movie Barnyard and its TV series Goldner–Harary graph, simple undirected graph with 11 vertices and 27 edges Goldner String Quartet, Australian string...

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...

there are not enough neighbors to go around. In particular, the Goldner–Harary graph, the Kleetope of the triangular bipyramid, has six vertices added...

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

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

In graph theory, a k-tree is an undirected graph formed by starting with a (k + 1)-vertex complete graph and then repeatedly adding vertices in such a...

before stopping. The Goldner–Harary graph is an Apollonian network that forms the smallest non-Hamiltonian maximal planar graph. Another more complicated...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

(geometry) Convex uniform honeycomb Elongated square gyrobicupola Goldner–Harary graph Pentagram map Simplicial sphere Star coloring Star polygon Grünbaum's...