An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard

DOI10.1016/S0166-218X(01)00244-XzbMath0993.05105OpenAlexW2040300226MaRDI QIDQ1613386

Alewyn P. Burger, Christina M. Mynhardt

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00244-x

zbMATH Keywords

dominationchessboardqueen

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Queen's domination using border squares and \((A,B)\)-restricted domination ⋮ Minimum dominating set of queens: a trivial programming exercise? ⋮ Domination in Chessboards ⋮ An improved upper bound for queens domination numbers

Cites Work

• Chessboard domination problems
• On the queen domination problem
• Domination and irredundance in the queens' graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard