Two sufficient conditions for a 2-factor in a bipartite graph
暂无分享,去创建一个
In this paper we prove that every 1-tough bipartite graph which is not isomorphic to K1,1 has a 2-factor. We also obtain a sufficient condition for the existence of a 2-factor in a bipartite graph, in the spirit of Hall's theorem.
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] P. Hall. On Representatives of Subsets , 1935 .
[3] Vasek Chvátal,et al. Tough graphs and hamiltonian circuits , 1973, Discret. Math..