VERTEX-DISJOINT QUADRILATERALS IN BIPARTITE GRAPHS  

作　　者：YANJin LIUGuizhen 

机构地区：[1]SchoolofMathematics&SystemsScience,ShandongUniversity,Jinan250100,China

出　　处：《Journal of Systems Science & Complexity》2004年第4期532-537,共6页系统科学与复杂性学报（英文版）

基　　金：This research is supported by the National Natural Science Foundation of China(60172003) and NSF of Shandong Province(Z2000A02).

摘　　要：H. Wang considered the minimum degrees condition that G has largevertex-disjoint cycles in bipartite graphs. Motivated by this, we consider the small vertex-disjointcycles in bipartite graphs in this paper. We prove the following result: Let m ≥ 3, n ≥ 2 and k≥ 1 be three integers. Let G = (V_1,V_2;E) be a bipartite graph with |V_1| = |V_2| = n ≥ 2k+1.

关 键 词：GRAPHS bipartite graphs QUADRILATERALS cycles 

分 类 号：O157.5[理学—数学]