设k≥3是一个正整数,G=(X,Y;E)是一个顶点数为4k的偶图,且有||X=||Y=2k。设δ(G)≥k+1,则图G包含k-3个4-圈,1个6-圈和一条含6个顶点的路,且它们是相互独立的。
Abatract: Let k ≥ 3 be a positive integer.Let G =(X,Y; E) be a bipartite graph with|| X = ||Y = 2k.Supposing δ(G)≥ k + 1,then G has a spanning subgraph consisting of k- 3 quadrilaterals, one 6-cycle and a path of order 6 such that all of them are independent.