|
Abstract
|
Bauer, Morgana, Schmeichel and Veldman have conjectured that the circumference of any 1-tough graph of order with minimum degree is at least . They proved that under these conditions, . Then Bauer, Schmeichel and Veldman improved this result by getting . We show in this paper that.
|
