Hamiltonian cycles in 3-connected Claw-free graphs

被引：7
作者：
Li, GJ [1 ]
Lu, M
Liu, Z
机构：
[1] Shandong Univ, Dept Math, Jinan 250100, Peoples R China
[2] Tsing Hua Univ, Dept Math, Beijing, Peoples R China
[3] Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
来源：
DISCRETE MATHEMATICS | 2002年 / 250卷 / 1-3期
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1016/S0012-365X(01)00279-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
It is shown that every 3-connected claw-free graph having at most 6delta - 7 vertices is hamiltonian. where delta is the minimum degree. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：137 / 151
页数：15
相关论文
共 9 条
  • [1] Bondy J.A., 2008, GRAD TEXTS MATH
  • [2] ON HAMILTONIAN CLAW-FREE GRAPHS
    FLANDRIN, E
    FOUQUET, JL
    LI, H
    [J]. DISCRETE MATHEMATICS, 1993, 111 (1-3) : 221 - 229
  • [3] LI GJ, 1993, ADV MATH, V1, P88
  • [4] HAMILTONIAN CYCLES IN 3-CONNECTED CLAW-FREE GRAPHS
    LI, MC
    [J]. JOURNAL OF GRAPH THEORY, 1993, 17 (03) : 303 - 313
  • [5] LIU Y, 1989, HAMILTON CYCLES 2 CO, V2
  • [6] MATHEWS M, 1985, J GRAPH THEOR, V9, P267
  • [7] MATTHEWS M, 82004 U S CAR DEP CO
  • [8] WU ZS, 1991, KEXUE TONGBAO, V2
  • [9] HAMILTON CYCLES IN CLAW-FREE GRAPHS
    ZHANG, CQ
    [J]. JOURNAL OF GRAPH THEORY, 1988, 12 (02) : 209 - 216
1