Unique NAC-colouring conjecture for minimally rigid graphs
Statement
Let be a minimally rigid graph. Unique NAC-colouring conjecture. We have
if and only if either and it has exactly one -prism subgraph, or is a -extension graph with exactly one open step. The conjecture has been verified by computer for graphs on up to vertices; the stated graph families are known to satisfy , but the converse remains open.
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.