Cycles in a graph whose lengths differ by one or two

✍ Scribed by Bondy, J. A.; Vince, A.

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 116 KB
• Volume: 27
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(199801)27:1<11::aid-jgt3>3.0.co;2-j

✦ Synopsis

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?