Counting K-4-subdivisions
文献类型：期刊论文
| 作者 | Miltzow, T ; Schmidt, JM ; Xia, MJ |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2015 |
| 卷号 | 338期号:12页码:2387-2392 |
| 关键词 | Counting K-4-subdivisions Cycles 3-connected graphs |
| ISSN号 | 0012-365X |
| 中文摘要 | A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of K-4. As a generalization, we ask for the minimum number of K-4-subdivisions that are contained in every 3-connected graph on n vertices. We prove that there are Omega(n(3)) such K-4-subdivisions and show that the order of this bound is tight for infinitely many graphs. We further investigate a better bound in dependence on m and prove that the computational complexity of the problem of counting the exact number of K-4-subdivisions is OP-hard. (C) 2015 Elsevier B.V. All rights reserved. |
| 英文摘要 | A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of K-4. As a generalization, we ask for the minimum number of K-4-subdivisions that are contained in every 3-connected graph on n vertices. We prove that there are Omega(n(3)) such K-4-subdivisions and show that the order of this bound is tight for infinitely many graphs. We further investigate a better bound in dependence on m and prove that the computational complexity of the problem of counting the exact number of K-4-subdivisions is OP-hard. (C) 2015 Elsevier B.V. All rights reserved. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000359955700026 |
| 公开日期 | 2016-12-13 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/17424]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Miltzow, T,Schmidt, JM,Xia, MJ. Counting K-4-subdivisions[J]. DISCRETE MATHEMATICS,2015,338(12):2387-2392. |
| APA | Miltzow, T,Schmidt, JM,&Xia, MJ.(2015).Counting K-4-subdivisions.DISCRETE MATHEMATICS,338(12),2387-2392. |
| MLA | Miltzow, T,et al."Counting K-4-subdivisions".DISCRETE MATHEMATICS 338.12(2015):2387-2392. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。