KMS Of Academy of mathematics and systems sciences, CAS
| Cyclability of 3-connected graphs | |
| Harkat-Benhamdine, A; Li, H; Tian, F | |
| 2000-07-01 | |
| 发表期刊 | JOURNAL OF GRAPH THEORY
 |
| ISSN | 0364-9024 |
| 卷号 | 34期号:3页码:191-203 |
| 摘要 | A subset S of ver tices of a graph G is called cyclable in G if there is in G some cycle containing all the vertices of S. We denote by alpha(S,G) the number of vertices of a maximum independent set of G[S]. We prove that if G is a 3-connected graph or order n and if S is a subset of vertices such that the degree sum of any four independent vertices of S is at least n + 2 alpha(S, G)-2, then S is cyclable. This result implies several known results on cyclability or Hamiltonicity. (C) 2000 John Wiley & Sons, Inc. |
| 语种 | 英语 |
| WOS研究方向 | Mathematics |
| WOS类目 | Mathematics |
| WOS记录号 | WOS:000087574800001 |
| 出版者 | JOHN WILEY & SONS INC |
| 引用统计 | |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/15560 |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Harkat-Benhamdine, A |
| 作者单位 | 1.Univ Paris 11, LRI, URA 410 CNRS, F-91405 Orsay, France 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Harkat-Benhamdine, A,Li, H,Tian, F. Cyclability of 3-connected graphs[J]. JOURNAL OF GRAPH THEORY,2000,34(3):191-203. |
| APA | Harkat-Benhamdine, A,Li, H,&Tian, F.(2000).Cyclability of 3-connected graphs.JOURNAL OF GRAPH THEORY,34(3),191-203. |
| MLA | Harkat-Benhamdine, A,et al."Cyclability of 3-connected graphs".JOURNAL OF GRAPH THEORY 34.3(2000):191-203. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论