图中的泛独立圈

On Independent Circuits in Graphs

本文得到如下结果:设G是一个简单图,|G|=n_1+n_1,8≤n_1,n_2≤N—8。n_1,n_2为正整数.f(G)=min {d(u)+d(v):u,v∈▽(G),uv(?)(G)}.如果f(G)≥n+1,则G中含两个点不交的、长度分别为n_1、n_2的圈.

In this paper, the author obtained the following result; Let G be a simple graph on n_1+n_2 vertices, |G |=n=n_1+n_2,8≤n_1,n_2≤n—8.f(G) =min{d(u) +d (v): uv∈▽(G,)uv(?)E(G) }.If f (G)≥n+1, then G contains two independent circuits of lengths n_1 and n_2.