Polynomial-time computability of the maximum forcing number for elementary polyomino graphs
Xu et al.'s conjecture. The maximum forcing number of GGG can be computed in polynomial time.
MathDB