摘要
设G=(X,Y;E)是一个偶图.如果|X|≥2|Y|-3且d(ν)=3对任意 υ∈X,那么G含有K3,3的剖分.有例子表明|X|的下界在一定程度上是不可改进的.
Let G = (X, Y; E) be a bipartite graph. If |X| ≥ 2| Y| - 3 and d(v) = 3 for all v ∈ X, then G contains a subdivision of K3,3. It is also exemplified that the lower bound of |X| cannot be improved to some extent.
出处
《运筹学学报》
CSCD
北大核心
2003年第1期65-72,共8页
Operations Research Transactions
基金
Supported by NNSF of China(19971071)and Doctoral Fund of Zhangzhou Normal College.
