NP-completeness of induced cycle for cubic graphs
Statement
A cubic graph is a graph in which every vertex has degree . The decision problem INDUCED CYCLE asks whether a graph has an induced cycle of the specified type considered in the paper.
Cubic induced-cycle NP-completeness conjecture. INDUCED CYCLE is NP-complete for cubic graphs.
The paper proves NP-completeness for graphs of maximum degree but conjectures the stronger result for cubic graphs; the source gives no resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.