An improved upper bound for queens domination numbers

DOI10.1016/S0012-365X(02)00802-6zbMath1015.05066OpenAlexW2166530698MaRDI QIDQ1810636

Christina M. Mynhardt, Alewyn P. Burger

Publication date: 9 June 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00802-6

zbMATH Keywords

dominating setqueen's graphchessboardtoroidal chessboard

Mathematics Subject Classification ID

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

Related Items (4)

The rook problem on saw-toothed chessboards ⋮ Minimum dominating set of queens: a trivial programming exercise? ⋮ Irredundance ⋮ Domination in Chessboards

Cites Work

• Chessboard domination problems
• Domination and irredundance in the queens' graph
• An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
• Upper bounds for the domination numbers of toroidal queens graphs
• Values of domination numbers of the queen's graph
• Upper bounds for domination numbers of the queen's 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 improved upper bound for queens domination numbers