【摘要】 设G是2-连通图,λ(G)=min{d(u)+d(v)|u,v∈V(G),uv■E(G)},本文证明了除六类图外,G中最长圈的长c(G)≥min{|v(G)|,λ+2}。更多还原

【Abstract】 We show that, if G is a 2-connected graph and λ(G)=min{d(u)+d(v)|u,v∈V(G),uv■E(G)} then G contains a cycle of length at least min {|V(G)}, λ+2} (With the exception of six graphical types).更多还原