摘要
本文给出同阶(阶数≥7)不含k_3的(p,p)图对{G_1,G_2}是可包装的充要条件。
In this paper, the author has proved a sufficient and necessary condition for packing (p,p) graph pair {G,G} in the same order (#####7), which does not contain k,.
出处
《高校应用数学学报(A辑)》
CSCD
北大核心
1991年第1期66-70,共5页
Applied Mathematics A Journal of Chinese Universities(Ser.A)