Georges Graph


The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph.

It is implemented in the Wolfram Language as GraphData["GeorgesGraph"].


The original embedding showing the construction is illustrated above (Grünbaum 2006).

See also

Bicubic Graph, Bicubic Nonhamiltonian Graph, Nonhamiltonian Graph

Explore with Wolfram|Alpha


Bondy, J. A. and Murty, U. S. R. Graph Theory. Berlin: Springer-Verlag, pp. 487-488, 2008.Georges, J. P. "Non-Hamiltonian Bicubic Graphs." J. Combin. Th. B 46, 121-124, 1989.Grünbaum, B. "3-Connected Configurations (n_3) with No Hamiltonian Circuit." Bull. Inst. Combin. Appl. 46, 15-26, 2006.Grünbaum, B. Configurations of Points and Lines. Providence, RI: Amer. Math. Soc., p. 311, 2009.

Cite this as:

Weisstein, Eric W. "Georges Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications