摘要
本文研究了 Ore k-型图的若干表征其结构的性质,并证明了 Ore k-型图 G在 δ(G)=k+2≤n+1或δ(G)≥n+k的条件下含有k+2个边不重的1-因子.从而部分地证实了Win 猜想.
Some properties describing the construction of Ore k-type graphs have been stu- died, and partly proved that the Win's conjecture hold for δ(G) = k+2≤n+1 or δ(G)≥n+k.
出处
《福州大学学报(自然科学版)》
CAS
CSCD
1991年第3期1-5,共5页
Journal of Fuzhou University(Natural Science Edition)