On bounds for a board covering problem
From MaRDI portal
Publication:1101453
DOI10.1016/0020-0190(87)90201-8zbMath0643.05011OpenAlexW2012953283MaRDI QIDQ1101453
Vijay Raghavan, Shankar M. Venkatesan
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90201-8
Related Items (7)
On bounds for a board covering problem ⋮ Queen domination of even square boards ⋮ Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions ⋮ Minimum dominating set of queens: a trivial programming exercise? ⋮ Domination of the rectangular queen's graph ⋮ Upper bounds for domination numbers of the queen's graph ⋮ Domination in Chessboards
Cites Work
- On the diagonal queens domination problem
- Domination parameters for the bishops graph
- On bounds for a board covering problem
- Independent permutations, as related to a problem of Moser and a theorem of Polya
- Constructions for the Solution of the m Queens Problem
- Unsolved problems in number theory
- Unnamed Item
This page was built for publication: On bounds for a board covering problem
