极大路原理与图中的路和圈

MAXIMAL PATH PRINCIPLE AND PATHS AND CYCLES IN GRAPHS

设G为n阶2—连通图,顶点v_1,v_2,…,v_n满足d_1≤d_2≤…≤d_n,其中d_i=d(v_i),i=1,2,…,n.本文主要给出周长c(G)≥min{n,m}的如下条件:

Let G be a 2-connected graph of order n with vertices v1 ,v2,…,vn, satisfying where di = d(vi) for all (?). This paper establishes the following sufficient condition guaranting the circumference of G