| 关于Ore—（1）型图中的Hamilton圈 |
| |
| 引用本文： | 李明楚,李忠祥.关于Ore—（1）型图中的Hamilton圈[J].北京科技大学学报,1992,14(4):483-489. |
| |
| 作者姓名： | 李明楚 李忠祥 |
| |
| 作者单位： | 北京科技大学数学力学系
(李明楚)，北京科技大学数学力学系(李忠祥) |
| |
| 摘 要： |
|
| 关 键 词： | 1－因子 Ore－（1）型图 哈密顿圈 |
Hamilton Cycles in the Graphs of Ore-Type-(1) |
| |
| Li Mingchu Li Zhongxiang.Hamilton Cycles in the Graphs of Ore-Type-(1)[J].Journal of University of Science and Technology Beijing,1992,14(4):483-489. |
| |
| Authors: | Li Mingchu Li Zhongxiang |
| |
| Institution: | Li Mingchu Li Zhongxiang Department of Mathematics and Mechanics |
| |
| Abstract: | It was proved by S. Win in 1982 that if the sum of the degree of nonadjacent vertices of a simple graph G of order 2n is at least 2n + 1, then G has a Hamilton cycle and a 1-factor which are edge-disjoint. In this paper, it is proved that, under almost the same condition as Win's theorem, G has at least two Hamilton cycles and a 1-factor which are edge-disjoint. |
| |
| Keywords: | Hamilton cycle 1-factor Ore-type-(1) |
| 本文献已被 CNKI 维普 等数据库收录！ |
