NP-completeness of minimal queen completion on chessboards
Chessboard queen completion conjecture. The minimal chessboard domination queen completion problem is NP-complete.
MathDB