1 paper
Jun Gao, Binlong Li, Jie Ma +1
Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart…