Chessboard domination problems
From MaRDI portal
Publication:1174120
DOI10.1016/0012-365X(90)90344-HzbMath0818.05057WikidataQ127683709 ScholiaQ127683709MaRDI QIDQ1174120
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (35)
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 ⋮ The rook problem on saw-toothed chessboards ⋮ Elementary components of essentially disconnected polyomino graphs ⋮ Queen domination of even square boards ⋮ Art gallery problem with rook and queen vision ⋮ Domination by queens on a square beehive ⋮ Relation-algebraic modeling and solution of chessboard independence and domination problems ⋮ The Pfaffian property of graphs on the Möbius strip based on topological resolution ⋮ On maximal resonance of polyomino graphs ⋮ The number of Kekulé structures of polyominos on the torus ⋮ Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions ⋮ A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs ⋮ The structure character of essentially disconnected polyomino graphs ⋮ The atom-bond connectivity index of catacondensed polyomino graphs ⋮ Pfaffian polyominos on the Klein bottle ⋮ On the independent queens covering problem ⋮ On \(k\)-resonance of grid graphs on the plane, torus and cylinder ⋮ The spectrum and spanning trees of polyominos on the torus ⋮ On the queen domination problem ⋮ Minimum dominating set of queens: a trivial programming exercise? ⋮ Toroidal boards and code covering ⋮ A tour problem on a toroidal board ⋮ Domination of the rectangular queen's graph ⋮ Upper bounds for domination numbers of the queen's graph ⋮ Enumeration of Wiener indices in random polygonal chains ⋮ Irredundance ⋮ Domination in Chessboards ⋮ An improved upper bound for queens domination numbers ⋮ The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes ⋮ Geometric dominating sets -- a minimum version of the no-three-in-line problem ⋮ Board games, random boards and long boards ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
- On the diagonal queens domination problem
- Domination parameters for the bishops graph
- On Non-Averaging Sets of Integers
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Unsolved problems in number theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Chessboard domination problems
