Longest Cycles in Circulant Graphs
Walter Harnau, Denis Jordan · 1990
In 1969 L. LOVASZ /2/ conjectured that every connected vertex transitive graph has a Hamilton path. L.BABAI /1/ proved the validity of this conjecture for graphs with a prime number of vertices. In the same paper he stated, that no useful results on the length of longest cycles in vertex transitive graphs are known. In this paper we generalize the result of /1/ in two directions. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.