图中有边不交的3个1─因子的一个新充分条件
A New Sufficient Condition for A Graph to Contain Three Disjoint 1-Factors
-
摘要: Win于1982年证明了2n阶Ore-(1)型图有边不交的3个1-因子.本文改进这个结果,得到一个新的充分条件:2n(n ≥ 10)阶2-连通Ore-(-2)型图G有边不交的1个Hamilton图和1个1-因子,除非G是附图中所示的图之一.Abstract: It was proved by S Win in 1982 that every Ore-type-(1) graph of order 2n has a Hamilton cycle and a 1-factor which are edge-disjoint.In this paper, we obtain the following theorem Every 2-connected Ore-type-(-2) graph G of order 2n(n ≥ 10) has a Hamilton cycle and a 1-factor which are edge-disjoint unless G is one of the graphs in Figure.
下载: