Minimum degree and the existence of semiregular factors in planar graphs
暂无分享,去创建一个
Let G be a simple planar graph and let α be a positive integer such that 1 ≤ α ≤ 3 and δ(G) ≥ α + 2. For every pair of edges e1, e2 of G, the graph G− {e1, e2} contains an [α, α + 1]-factor.
[1] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[3] Hikoe Enomoto,et al. Connected Spanning Subgraphs of 3-Connected Planar Graphs , 1996, J. Comb. Theory, Ser. B.