On the queen domination problem
From MaRDI portal
Publication:1174123
DOI10.1016/0012-365X(90)90345-IzbMath0742.05021OpenAlexW1964459245MaRDI QIDQ1174123
David van Stone, Bruce Hahne, Charles M. Grinstead
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90345-i
Related Items (16)
An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard ⋮ A maximum resonant set of polyomino graphs ⋮ A minimax result for perfect matchings of a polyomino graph ⋮ Perfect matchings in random polyomino chain graphs ⋮ Elementary components of essentially disconnected polyomino graphs ⋮ Art gallery problem with rook and queen vision ⋮ The number of Kekulé structures of polyominos on the torus ⋮ A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs ⋮ The structure character of essentially disconnected polyomino graphs ⋮ The spectrum and spanning trees of polyominos on the torus ⋮ Perfect matchings in random octagonal chain graphs ⋮ Regular generalized polyomino graphs ⋮ Enumeration of Wiener indices in random polygonal chains ⋮ Domination in Chessboards ⋮ The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
This page was built for publication: On the queen domination problem
