The following pages link to On the queen domination problem (Q1174123):
Displaying 16 items.
- A maximum resonant set of polyomino graphs (Q274682) (← links)
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- Perfect matchings in random polyomino chain graphs (Q282170) (← links)
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (Q424181) (← links)
- The spectrum and spanning trees of polyominos on the torus (Q460943) (← links)
- Regular generalized polyomino graphs (Q551868) (← links)
- The structure character of essentially disconnected polyomino graphs (Q631449) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Elementary components of essentially disconnected polyomino graphs (Q848177) (← links)
- An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard (Q1613386) (← links)
- Enumeration of Wiener indices in random polygonal chains (Q1799144) (← links)
- The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes (Q1815325) (← links)
- The number of Kekulé structures of polyominos on the torus (Q1936985) (← links)
- Perfect matchings in random octagonal chain graphs (Q2230025) (← links)
- Art gallery problem with rook and queen vision (Q2657110) (← links)
- Domination in Chessboards (Q3384118) (← links)
