The Sousselier graph is a hypohamiltonian, maximally nonhamiltonian, and platypus graph on 16 vertices. It is illustrated above in a number of embeddings.
The Sousselier graph is implemented in the Wolfram Language as GraphData["SousselierGraph"].
Sousselier Graph
See also
Hypohamiltonian Graph, Lindgren-Sousselier Graphs, Maximally Nonhamiltonian Graph, Platypus GraphExplore with Wolfram|Alpha
References
Chvátal, V. "Flip-Flops in Hypo-Hamiltonian Graphs." Canad. Math. Bull. 16, 33-41, 1973.Herz, J. C.; Duby, J. J.; and Vigué, F. "Recherche systématique des graphes hypohamiltoniens." Theory of Graphs. Dunod, pp. 153-159, 1967.House of Graphs. "Sousselier Graph." https://houseofgraphs.org/graphs/1329.Lindgren, W. F. "An Infinite Class of Hypohamiltonian Graphs." Amer. Math. Monthly 74, 1087-1089, 1967.Sousselier, R. "Problème No. 29: Le Cercle Des Irascibles." Rev. Franç. Rech. Opérationnelle 7, 405-406, 1963.Wolz, J. "Engineering Linear Layouts with SAT." Master Thesis. Tübingen, Germany: University of Tübingen, 2018.Cite this as:
Weisstein, Eric W. "Sousselier Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SousselierGraph.html