Detecting wheels
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.