OF-f型图的极图

Extremal Graph of OF-f Type Graph

设 G 为2—连通简单图,对 G 中任何两个不相邻的顶点 x,y 均有 max{d(x),d(y)}≥f/2(f≥14),则除四类极图外,G 的最长圈长 C(G)≥f+2.

Let G is a 2--connected simple graph and max{d(x),d(y)}≥f/2 for any pairs of nonadjacent verticcs x,y,then Longest cycles C(G)≥f+2, with the exccption of four kinds of graphs.