Morris, Dave Witte; Morris, Joy; Webb, Kerri Hamiltonian cycles in (2,3,c)-circulant digraphs. (English) Zbl 1229.05181 Discrete Math. 309, No. 17, 5484-5490 (2009). Summary: Let \(D\) be the circulant digraph with \(n\) vertices and connection set \(\{2,3,c\}\). (Assume \(D\) is loopless and has outdegree 3.) Work of S. C. Locke and D. Witte implies that if \(n\) is a multiple of 6, \(c\in \{(n/2)+2,(n/2)+3\}\), and \(c\) is even, then \(D\) does not have a hamiltonian cycle. For all other cases, we construct a hamiltonian cycle in \(D\). Cited in 3 Documents MSC: 05C38 Paths and cycles 05C45 Eulerian and Hamiltonian graphs 05C20 Directed graphs (digraphs), tournaments Keywords:Hamiltonian cycle; circulant; directed graph PDFBibTeX XMLCite \textit{D. W. Morris} et al., Discrete Math. 309, No. 17, 5484--5490 (2009; Zbl 1229.05181) Full Text: DOI arXiv References: [1] Locke, Stephen C.; Witte, Dave, On non-hamiltonian circulant digraphs of outdegree three, J. Graph Theory, 30, 4, 319-331 (1999), MR1669452 · Zbl 0921.05035 [2] Rankin, R. A., A campanological problem in group theory, Proc. Cambridge Philos. Soc., 44, 17-25 (1948), MR0022846 · Zbl 0030.10606 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.