NP-completeness conjecture for regular completions of trees
Statement
Let be a tree of maximum degree . For , let be a -regular graph obtained from by adding semi-edges or loops so that every vertex of has degree ; this graph is not uniquely determined. Regular-tree completion conjecture. If and is constructed as above, then the problem is NP-complete even for simple input graphs. This is proposed as an open question arising from the paper's results, and its proof is described as a further goal.
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.