ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a connected cubic graph. The HH-problem asks, for a connected cubic graph GG, whether GG admits an HH-coloring. Let CNP\mathcal{C}_{NP} be the class of connected cubic graphs HH for which the HH-problem is NP-complete.

Hereditary-class conjecture. The class CNP\mathcal{C}_{NP} is a hereditary class of cubic graphs.

The source motivates this conjecture by comparing the complexity of the HH-problem for several target graphs, including S10S_{10}, S12S_{12}, P10P_{10} and P12P_{12}. Its status is left open in the supplied text.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.