Hamilton-connected;
hamiltonian cycle;
line graph;
claw-free graph;
spanning trail;
D O I:
10.1002/jgt.20099
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G be a graph and let V-0 = {v epsilon V(G): d(G)(v)= 6}. We show in this paper that: (1) if G is a 6-connected line graph and if vertical bar V-0 vertical bar <= 29 or G[V-0] contains at most 5 vertex disjoint K-4's, then G is Hamilton-connected; (ii) every 8-connected claw-free graph is Hamilton-connected. Several related results known before are generalized. (c) 2005 Wiley Periodicals, Inc.
机构:
Chongqing Technol & Business Univ, Coll Sci, Chongqing 400067, Peoples R ChinaChongqing Technol & Business Univ, Coll Sci, Chongqing 400067, Peoples R China
机构:
Department of Mathematics, Michigan State University, East LansingDepartment of Mathematics, Michigan State University, East Lansing
Palmer, Edgar M.
Read, Ronald C.
论文数: 0引用数: 0
h-index: 0
机构:
Dept. of Combinatorics Optimization, Faculty of Mathematics, University of Waterloo, WaterlooDepartment of Mathematics, Michigan State University, East Lansing
Read, Ronald C.
Robinson, Robert W.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Computer Science, University of Georgia, Athens, GA 30602-7404Department of Mathematics, Michigan State University, East Lansing