6 problems

Let $e\geq p\geq 2$, and let $C'=\{C'_0,\ldots,C'_p\}$ and $R'=\{R'_0,\ldots,R'_p\}$ satisfy … Suppose that for every $0\leq i,j\leq p$, either $C'_i+R'_j\bmod e\in C'\cap R'$ or b…

Four-sided hypercube queen conjecture. The maximal non-attacking queen set problem on a $d$-dimensional hypercube of side length $4$ has solution size

Chessboard queen completion conjecture. The minimal chessboard domination queen completion problem is NP-complete.

Convex-polyomino maximal queen domination conjecture. The maximal domination problem for non-attacking queens on convex polyominoes is NP-complete.

Convex-polyomino queen domination conjecture. The minimal domination problem for attacking, or non-attacking, queens on convex polyominoes is NP-complete.

Maximal independent queen domination conjecture. The maximal independent queen domination problem on polyominoes is NP-complete.