  A Harris Graph is a tough, Eulerian, non-Hamiltonian graph. Several
approaches to creating new Harris graphs from existing ones are explored,
including creating families of Harris graphs and combining Harris graphs.
Pictures of all Harris Graphs through order 9 and the number of Harris graphs
through order 12 are included. We also prove a result about barnacle-free
Harris graphs.
