On the diagonal queens domination problem

DOI10.1016/0097-3165(86)90012-9zbMath0589.05014OpenAlexW2065090732MaRDI QIDQ1073797

E. J. Cockayne, Stephen T. Hedetniemi

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90012-9

zbMATH Keywords

arithmetic progressionchessboarddiagonal dominating seteven-sum subsetmidpoint-free

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Arithmetic progressions (11B25)

Related Items (11)

Domination parameters for the bishops graph ⋮ The equidistant dimension of graphs ⋮ On bounds for a board covering problem ⋮ Domination by queens on a square beehive ⋮ On the independent queens covering problem ⋮ Finding large 3-free sets. I. The small \(n\) case ⋮ Chessboard domination problems ⋮ Queen's domination using border squares and \((A,B)\)-restricted domination ⋮ A tour problem on a toroidal board ⋮ Domination in Chessboards ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On the diagonal queens domination problem