On non-Hamiltonian circulant digraphs of outdegree three
Stephen C. Locke, Dave Witte · Journal of Graph Theory · 1999
We construct infinitely many connected, circulant digraphs of outdegree three that have no Hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vertex is adjacent to the vertex diametrically opposite to itself. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 319–331, 1999