Problem List (problem 31)
Statement
-forcing edge weighted: let be the weight of edge . let be filled, if then forces all unfilled neighbors. Minimize number of vertices needed to force the graph.
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.