ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with maximum degree Delta(G)≤4Delta(G) \le 4, let λ≥2\lambda \ge 2, and let HH be a backbone. For an integer ll, BBCλ(G,H)≤lBBC_{\lambda}(G,H) \le l denotes the λ\lambda-backbone coloring problem with at most ll colors. Backbone coloring complexity conjecture. For any l≥λ+2l \ge \lambda+2 when HH is a matching or a galaxy, or l≥λ+3l \ge \lambda+3 when HH is a Hamiltonian path or a spanning tree, the problem BBCλ(G,H)≤lBBC_{\lambda}(G,H) \le l is either trivial, meaning that the answer is YES for all graphs, or NP\mathcal{NP}-complete. This conjecture proposes a uniform complexity description for fixed maximum degree four, while the cases for galaxy, path, and tree backbones that are not covered by known results remain open.

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.