摘要
设G是 p阶l坚韧图。本文证明:如果对任意d(u,v)=2的u,v∈V(G),有max{d(u),d(v)}≥b,则除图Y_1,Y_2,Y_3外,G包含一个长至少为min{p,2b+2}的圈,且是最好可能的。
Let G be a 1-tough graph with p vertices. If max{d(u), d(v)}≥6 for any u,v∈ F(G) of which d(u, v) = 2, it is proved that G contains a cycle of which the length is at least min{p,2b + 2} and is possibly the best, except for those graphs Y1,Y2, and Y3.
