On 2-factors in claw-free graphs
文献类型：期刊论文
| 作者 | Faudree, R; Favaron, O; Flandrin, E; Li, H; Liu, ZH |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 1999-08-28 |
| 卷号 | 206期号:1-3页码:131-137 |
| ISSN号 | 0012-365X |
| 英文摘要 | A graph is said claw-free if it contains no induced subgraph isomorphic to K-1,K-3. We prove that if G is a claw-free graph with minimum degree delta greater than or equal to 4, then G contains a 2-factor with at most 6n/(delta + 2) - 1 components. Moreover, together with a theorem of Choudoum and Paulraj (J. Graph Theory 15 (1991) 259-265) and one of Anstee (J. Algorithms 6 (1985) 112-131), it is polynomial (n O(n(3))) to construct such a a-factor. (C) 1999 Elsevier Science B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000082183600012 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/14456]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.Memphis State Univ, Dept Math Sci, Memphis, TN 38152 USA 2.Univ Paris Sud, CNRS, URA 410, LRI, F-91405 Orsay, France 3.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Faudree, R,Favaron, O,Flandrin, E,et al. On 2-factors in claw-free graphs[J]. DISCRETE MATHEMATICS,1999,206(1-3):131-137. |
| APA | Faudree, R,Favaron, O,Flandrin, E,Li, H,&Liu, ZH.(1999).On 2-factors in claw-free graphs.DISCRETE MATHEMATICS,206(1-3),131-137. |
| MLA | Faudree, R,et al."On 2-factors in claw-free graphs".DISCRETE MATHEMATICS 206.1-3(1999):131-137. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。