On the Graphs of Ore-Type-(3)-A Result of Win's Conjecture
-
摘要: 證明了Win猜想對k=3成立。實際上,且得到了更好的結論:2n(n≥10)階Ore-3型圖中存在邊不交的兩個Hamilton圈和一個1-因子,且對δ(G)=5而言,結論是最好可能的。Abstract: It is proved that Win's conjecture is true for k = 3. A better conclusion is obtained. There exist two Hamilton cycles and a 1-factor which are edge-disjoint in a Ore-type-(3) graph of order 2n (n≥10). Moreover, this result is best possible for δ(G)=5.
-
Key words:
- Hamilton cycle /
- Ore-type-(3) graph /
- factor
-
點擊查看大圖
計量
- 文章訪問數: 199
- HTML全文瀏覽量: 56
- PDF下載量: 7
- 被引次數: 0
下載:
