Ellingham and Horton (1983) constructed the 54-Ellingham-Horton graph using two copies of the 18-nodebicubic
graph
illustrated above, deleting the two dashed edges from
each and rejoining the resulting vertices of degree
2 to the other components. No Hamiltonian
cycle in
contains both specified edges. Georges (1989) used
as the basis of his construction of the Georges-Kelmans
graph. Each specified edge is subdivided
twice in the construction, and two copies of the resulting graph
are combined (Grünbaum 2009, pp. 310-311). However, Georges's published
drawing of graph omits one of the two specified edges
(Grünbaum 2009, p. 317).
Ellingham, M. N. "Non-Hamiltonian 3-Connected Cubic Partite Graphs." Dept. of Math. Research Report No. 28. Melbourne,
Australia: University of Melbourne, 1981.Ellingham, M. N. "Cycles
in 3-Connected Cubics Graphs." Master's thesis. Melbourne, Australia: University
of Melbourne, June 1982a.Ellingham, M. N. "Constructing Certain
Cubic Graphs." In Combinatorial Mathematics, IX: Proceedings of the Ninth
Australian Conference held at the University of Queensland, Brisbane, August 24-28,
1981 (Ed. E. J. Billington, S. Oates-Williams, and A. P. Street).
Berlin, Germany: Springer-Verlag, pp. 252-274, 1982b.Ellingham,
M. N. and Horton, J. D. "Non-Hamiltonian 3-Connected Cubic Bipartite
Graphs." J. Combin. Th. Ser. B34, 350-353, 1983.Georges,
J. P. "Non-Hamiltonian Bicubic Graphs." J. Combin. Th. B46,
121-124, 1989.Grünbaum, B. Configurations
of Points and Lines. Providence, RI: Amer. Math. Soc., pp. 310-311 and
317, 2009.House of Graphs. Ellingham-Horton Graphs. B
Subgraph of 54 Vertex Non-Hamiltonian 3 Connected Cubic Bipartite Graphs, Ellingham Horton Graph 54, and Ellingham Horton Graph 78.