Regular factors in regular graphs
暂无分享，去创建一个
Abstract Let G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m be an integer such that1⩽m⩽k − 1. Then the graph obtained by removing any k − m edges of G, has an m-factor.
[1] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[2] W. T. Tutte. The Factors of Graphs , 1952, Canadian Journal of Mathematics.
[3] J. Petersen. Die Theorie der regulären graphs , 1891 .
[4] J. Plesník. Connectivity of Regular Graphs and the Existence of 1-Factors , 1972 .
[5] J. A. Bondy,et al. Graph Theory with Applications , 1978 .