Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three
暂无分享，去创建一个
It is shown that if G is a 3-connected graph with |V(G)| ≥ 10, then, with the exception of one infinite class based on K3,p, it takes at least four vertices to cover the set of contractible edges of G. © 1993 John Wiley & Sons, Inc.
[1] Xingxing Yu,et al. 3-connected Graphs with Non-cut Contractible Edge Covers of Size K , 1994, J. Graph Theory.
[2] William T. Tutte,et al. A theory of 3-connected graphs , 1961 .
[3] Akira Saito,et al. Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets , 1990, J. Graph Theory.
[4] Hikoe Enomoto,et al. Contractible edges in 3-connected graphs , 1987, J. Comb. Theory, Ser. B.