LONGEST CYCLES IN 2-CONNECTEDCLAW-FREE GRAPHS  

作　　者：GAO Taiping (Department of Mathematics, University of Shanxi, Taiyuan 030006, China) LI Hao (L. R. I., URA 410 C.N.R.S. Bat. 490, Universite de Paris-sud 91405-Orsay CEDEX, France)WEI Bing (Institute of System Science, Academia Sinica, Beijing 100080, Chi 

出　　处：《Systems Science and Mathematical Sciences》1997年第2期176-182,共7页

摘　　要：M. Matthews and D. Sumner proved that if G is a 2-connected claw-free graph of order n, then c(G) min{2δb + 4, n}. In this paper, we prove that if G is a,2-connected claw-free graph on n venices, then c(G) min{3δ + 2, n} or G belongs to one exceptional class of graphs.M. Matthews and D. Sumner proved that if G is a 2-connected claw-free graph of order n, then c(G) min{2δb + 4, n}. In this paper, we prove that if G is a,2-connected claw-free graph on n venices, then c(G) min{3δ + 2, n} or G belongs to one exceptional class of graphs.

关 键 词：CONNECTED garph 2-connected CLAW-FREE GRAPH CYCLE longest cycle. 

分 类 号：F224[经济管理—国民经济]