Ore k-型图的性质和1-因子

The Properties and 1-factors of Ore k-Type Graphs

本文研究了 Ｏｒｅ ｋ－型图的若干表征其结构的性质，并证明了 Ｏｒｅ ｋ－型图 Ｇ在 δ（Ｇ）＝ｋ＋２≤ｎ＋１或δ（Ｇ）≥ｎ＋ｋ的条件下含有ｋ＋２个边不重的１－因子．从而部分地证实了Ｗｉｎ 猜想．

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.