Finding regular subgraphs in both arbitrary and planar graphs

被引：14
|
作者：
Stewart, IA
机构：
[1] Department of Computer Science, University College of Swansea
来源：
DISCRETE APPLIED MATHEMATICS | 1996年 / 68卷 / 03期
关键词：
D O I：
10.1016/0166-218X(95)00061-U
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We show that the problems of deciding (i) whether an arbitrary graph has a k-regular subgraph, for some given k greater than or equal to 3, (ii) whether a planar graph has a quartic subgraph, and (iii) whether a planar graph has a quintic subgraph, are complete for NP via logspace reductions. There are no regular planar graphs of degree greater than 5.
引用
收藏
页码：223 / 235
页数：13
相关论文
共 50 条
12345