| 4－连通无爪图中的Hamilton圈 |
| |
| 引用本文： | 韩贞耀. 4－连通无爪图中的Hamilton圈[J]. 辽宁师范大学学报(自然科学版), 1994, 0(2) |
| |
| 作者姓名： | 韩贞耀 |
| |
| 作者单位： | 辽宁师范大学数学系 |
| |
| 摘 要： | Ｍａｔｔｈｅｗｓ等猜想：每一个４－连通无爪图是Ｈ－图．本文证实当Ｇ不含局部连通点及３团时该猜想成立．
|
| 关 键 词： | 无爪图，Hamilton图，生成闭迹 |
HAMILTON CYCLES IN A 4-CONNECTED K_(1,3)-FREE GRAPH |
| |
| Han Zhenyao. HAMILTON CYCLES IN A 4-CONNECTED K_(1,3)-FREE GRAPH[J]. Journal of Liaoning Normal University(Natural Science Edition), 1994, 0(2) |
| |
| Authors: | Han Zhenyao |
| |
| Abstract: | Mattews and Sumner made the following conjecture: If G is a 4-connected K1,3-free graph,then G is hamilton. If G does not contain any locally connected vertex and any maximal complete subgraph K3,then the conjecture is verified in this paper. |
| |
| Keywords: | claw-free Hamiltonian cycle spanning closed trail |
| 本文献已被 CNKI 等数据库收录！ |
|
