2-连通无爪图的最长圈(英)

LONGEST CYCLES IN 2-CONNECTEDK_(1,3)-FREE GRAPHS

本文引入了图G的辐度ζ（G）的概念，讨论了2－连通无爪图的最长圈。设C（G）表示图G的最长圈，对于一个非Hamilton2－连通无爪图G，证明了：如果。

Study the length of longest cycles in 2-connected K1,3-free graphs. Intrduce the conceptof spoke numberζ(G). and for a graph G. prove that for a nonhamiltonian 2-connected K1,31. 2 free graph G, if ζ(G) (G) then c (G) , where c(G) is the length ofthe longest cycle and λ(G).