摘要
若G是 12阶均衡二分图 ,δ(G)≥ 4 ,则对G的任意一个完美对集M ,G中存在一个包含M的所有边的恰含 2个分支的 2 因子。
A bipartite graph G=(X,Y;E)is called balanced if |X|=|Y|.Let G=(X,Y;E) be a balanced bipartite graph of order 12 ,suppose that the minimum degree of G is at least 4,we show that for each pe rfect matching M,G contains a 2 factor with exactly 2 components(vertex dis jiont cycles)including every edge of M .
出处
《南阳师范学院学报》
CAS
2002年第6期1-4,共4页
Journal of Nanyang Normal University
