Detecting wheels

Emilie Diot, Sébastien Tavenas,Nicolas Trotignon

CoRR（2013）

引用 5|浏览6

暂无评分

摘要

A wheel is a graph made of a cycle of length at least 4 together with a vertex that has at least three neighbors in the cycle. We prove that the problem whose instance is a graph G and whose question is "does G contains a wheel as an induced subgraph" is NP-complete. We also settle the complexity of several similar problems.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要