On the girth of hamiltonian weakly pancy
β
BollobοΏ½s, BοΏ½la; Thomason, Andrew
π
Article
π
1997
π
John Wiley and Sons
π
English
β 130 KB
π 2 views
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. In answer to a question of ErdΕs, we show that a Hamiltonian weakly-pancyclic graph of order n can have girth as large as about 2 n/ log n. In contrast to this, we show that the existence of