摘要
A vertex of a graph is locally connected if its neighborhood is connected. A graph G is locally connected if every vertex of G is locally connected. A graph is called claw-free if it does not contain a copy of K1,3 as an induced subgraph. In this paper, we provide a constructive characterization of 4-connected 4-regular locally connected claw-free graphs. From its proof, we can give a linear polynomial-time algorithm to construct a 4-connected 4-regular locally connected claw-free graph.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | Computational Science - ICCS 2007 - 7th International Conference, Proceedings |
| 页 | 329-333 |
| 页数 | 5 |
| 版本 | PART 3 |
| 出版状态 | 已出版 - 2007 |
| 活动 | 7th International Conference on Computational Science, ICCS 2007 - Beijing, 中国 期限: 27 5月 2007 → 30 5月 2007 |
出版系列
| 姓名 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| 编号 | PART 3 |
| 卷 | 4489 LNCS |
| ISSN（印刷版） | 0302-9743 |
| ISSN（电子版） | 1611-3349 |
会议
| 会议 | 7th International Conference on Computational Science, ICCS 2007 |
|---|---|
| 国家/地区 | 中国 |
| 市 | Beijing |
| 时期 | 27/05/07 → 30/05/07 |
指纹
探究 'Linear polynomial-time algorithms to construct 4-connected 4-regular locally connected claw-free graphs' 的科研主题。它们共同构成独一无二的指纹。引用此
Li, M. C., Xiong, L., & Liu, H. (2007). Linear polynomial-time algorithms to construct 4-connected 4-regular locally connected claw-free graphs. 在 Computational Science - ICCS 2007 - 7th International Conference, Proceedings (PART 3 编辑, 页码 329-333). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 4489 LNCS, 号码 PART 3).