MathDB1 problem
Convex-polyomino rook domination conjecture. The minimal domination problem for attacking or non-attacking rooks on convex polyominoes is NP-complete.
Convex-polyomino rook domination conjecture. The minimal domination problem for attacking or non-attacking rooks on convex polyominoes is NP-complete.