Some sufficient conditions for the existence of a 1-factor
暂无分享,去创建一个
The following theorem is proved: Let G be a graph of even order. Assume that there exists a connected spanning subgraph F of G such that for every set U of four vertices in G, if the subgraph of F induced by U is a star, then the subgraph of G induced by U is complete. Then G has a 1-factor. The above theorem is derived from another sufficient condition for the existence of a 1-factor, which is also proved in this paper (Lemma 1).
[1] W. T. Tutte. The Factorization of Linear Graphs , 1947 .
[2] Herbert S. Wilf,et al. The interchange graph of a finite graph , 1965 .
[3] Gary Chartrand,et al. The existence of 1-factors in line graphs, squares, and total graphs , 1973 .