论文信息 - Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4] - 字舞流文

Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]

It is proved that ifG is ann-connected graph with minimum degree greater than or equal to [5n/4],n ≥ 4, thenG has an edgee such that the graph obtained fromG by contractinge is stilln-connected.

[1] Akira Saito. Contractible Edges in Graphs with Large Minimum Degree , 1990 .

[2] Carsten Thomassen,et al. Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.

[3] Peter J. Slater,et al. A note on $k$-critically $n$-connected graphs , 1977 .

[4] Carsten Thomassen,et al. Nonseparating cycles in K-Connected graphs , 1981, J. Graph Theory.

[5] W. Mader. Eine Eigenschaft der Atome endlicher Graphen , 1971 .

[6] Yoshimi Egawa,et al. Contractible edges in triangle-free graphs , 1986, Comb..

[7] Wolfgang Mader. Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen , 1985, Eur. J. Comb..

[8] Hikoe Enomoto,et al. Contractible edges in 3-connected graphs , 1987, J. Comb. Theory, Ser. B.

[9] Carsten Thomassen,et al. Non-separating induced cycles in graphs , 1981, J. Comb. Theory, Ser. B.