Long Cycles in Graphs with Moderate Connectivity
暂无分享，去创建一个
In this paper we supply bounds for the length of a longest cycle C in G in terms of the structure of G-V(C).
[1] H. A. Jung. LONGEST CIRCUITS IN 3-CONNECTED GRAPHS , 1984 .
[2] G. Dirac. Some Theorems on Abstract Graphs , 1952 .
[3] Min Aung. Longest cycles in triangle-free graphs , 1989, J. Comb. Theory, Ser. B.
[4] H. A. Jung. Longest paths joining given vertices in a graph , 1986 .
[5] P. Erdos,et al. Studies in Pure Mathematics , 1983 .