Dominating sets as marked centralizer covers in graph groups
Statement
Computational problems from graph groups
It is known that it is possible to establish correspondence between certain NP-hard graph problems and problems in group theory; we would like to expand our portfolio of such problems.
Record
- Source
- Added
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.