ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph GG 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 GG 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 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.