Equality between k-Grundy Z-domination and k-forcing number
Statement
Let be a graph with . The parameters and denote the -Grundy Z-domination number and the -forcing number, respectively.
Equality conjecture.
This conjecture would show that the lower bound established in the preceding theorem is always sharp. The supplied text gives no evidence that the conjecture has been resolved.
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.