A Problem on Claw-free Homogeneously Traceable

摘要：

In 1988 Faudree et al. proved that let G be a 3connected K1,3-free graph of order n, if |N(x) ∪ N (y)|≥(2n-4)/3 for each pair of nonadjacent vertices x.y, then G is Homogeneously traceable. In 1991nian Bauer et al. proved that let G be a 3-connected K1,3free graph of order n, if |N(x) ∪ N(y)|≥(2n-5)/3 for each pair of nonadjacent vertices x.y, then G is traceable. In this note we prove the further result: let G be a 3-connected K1,3~free graph of order n, if |N(x) ∪ N(y)|≥(2n-6)/3 for each pair of nonadjacent vertices x.y with 1≤|N(x)∩ N(y)|≤α-1, then G is Homogeneously traceable.

关键词： K1,3—free graphs Neighborhood unions Generalizing neighborhood unions Homogeneously traceable traceable

作者: Zu LI Ke-Wen ZHAO Yue LIN De-Qin CHEN

作者单位: Institute of Information Science and Mathematics,University of Qiongzhou,Sanya,China

会议类型: 国际会议

会议名称: 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management(2010年IEEE第17届工业工程与工程管理国际学术会议)

会议地点: 厦门

会议语种:英文

页码: 635-637

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）