1 problem

Matching

Polynomial-time computability of the maximum forcing number for elementary polyomino graphs
About 12 years old
Xu et al.'s conjecture. The maximum forcing number of $G$ can be computed in polynomial time.
opengraph-algorithms matching-theory polyomino-graphs
011