Path extendability of claw-free graphs
文献类型：期刊论文
| 作者 | Sheng, Yu; Tian, Feng; Wang, Jianglu; Wei, Bing; Zhu, Yongjin |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2006-08-28 |
| 卷号 | 306期号:16页码:2010-2015 |
| 关键词 | claw-free graphs detour locally connected path extendable |
| ISSN号 | 0012-365X |
| DOI | 10.1016/j.disc.2006.03.057 |
| 英文摘要 | 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 boolean AND {x, y} = 0, then each (x, y)-path of length less than n - 1 in G is extendable, that is, for any path P joining x and y of length h (< n - 1), there exists a path P' in G joining x and y such that V (P) subset of V (P') and vertical bar P'vertical bar = h + 1. This generalizes several related results known before. (c) 2006 Elsevier B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000240173300023 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/3803]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Sheng, Yu |
| 作者单位 | 1.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China 2.Shangdong Normal Univ, Dept Math, Jinan 250014, Peoples R China 3.Univ Mississippi, Dept Math, University, MS 38677 USA |
| 推荐引用方式 GB/T 7714 | Sheng, Yu,Tian, Feng,Wang, Jianglu,et al. Path extendability of claw-free graphs[J]. DISCRETE MATHEMATICS,2006,306(16):2010-2015. |
| APA | Sheng, Yu,Tian, Feng,Wang, Jianglu,Wei, Bing,&Zhu, Yongjin.(2006).Path extendability of claw-free graphs.DISCRETE MATHEMATICS,306(16),2010-2015. |
| MLA | Sheng, Yu,et al."Path extendability of claw-free graphs".DISCRETE MATHEMATICS 306.16(2006):2010-2015. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。