NP-completeness of mutual-visibility coloring
Statement
A graph has a mutual-visibility coloring if its vertices can be colored so that the required mutual-visibility condition holds; the associated decision problem asks whether admits such a coloring with a prescribed number of colors.
Mutual-visibility coloring conjecture. The mutual-visibility coloring decision problem is NP-complete.
The paper proves NP-completeness for the independent version, even for graphs with universal vertices, and conjectures that the same computational complexity holds for the basic version.
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.