Cubic or 3-connected hardness conjecture for Pirates and Treasure
Statement
Let be the graph input to the Pirates and Treasure game. A graph is cubic if every vertex has degree , and 3-connected if deleting fewer than three vertices does not disconnect it. Cubic or 3-connected hardness conjecture. Pirates and Treasure is NP-hard if is either cubic or 3-connected. This would extend the established NP-hardness results for planar and grid graphs to graph classes for which the path-adding reduction does not preserve the required structure; 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.