Note on k-contractible edges in k-connected graphs
暂无分享,去创建一个
It is proved that if G is a k-connected graph which does not contain K;; with k being odd, then G has an edge e such that the graph obtained from G by contracting e is still k-connected. The same conclusion does not hold when k is even. This result is a generalization of the famous theorem of Thomassen [J. Graph Theory 5 (1981), 351--354] when k is odd.
[1] Yoshimi Egawa,et al. Contractible edges in triangle-free graphs , 1986, Comb..
[2] R. Halin. A theorem on n-connected graphs , 1969 .
[3] Carsten Thomassen,et al. Nonseparating cycles in K-Connected graphs , 1981, J. Graph Theory.
[4] Yoshimi Egawa. Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4] , 1991, Graphs Comb..
[5] W. Mader. Ecken vom Gradn in minimalenn-fach zusammenhängenden Graphen , 1972 .