2连通无爪图的周长

The Circumferences of 2-Connected K1,3-Free Graphs

本文给出p阶2连通无爪图G的周长的下界的新的形式:c(G)≥min{p,2λ-2δ+4},这里λ=min{d(u+d(v)│u,v∈V(G),uv∈E(G)}.

This paper gives a better lower bound of the circumference in 2-connected K1,3-free graphs G with p vertices. c(G)≥min {p,2λ-2δ+}, where λ=min{d(u)+d(v)|u, v∈V(G), uv∈E(G)}.