Cycles in a graph whose lengths differ by one or two
J. Adrian Bondy, Andrew Vince · Journal of Graph Theory · 1998
Several problems concerning the distribution of cycle lengths in a graph have been proposed by P. Erdös and colleagues. In this note two variations of the following such question are answered. In a simple graph where every vertex has degree at least three, must there exist two cycles whose lengths differ by one or two? © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 11–15, 1998