Path extendability of claw-free graphs

Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x, y)-path of length less than n - 1 in G is extendable, that is, for any path P

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu
• Keywords: Claw-free Graph, DM 2006, Locally Connected, Paper