You are currently offline. Some features of the site may not work correctly.

Corpus ID: 4184832

Independence and Domination Separation on Chessboard Graphs

@inproceedings{Chatham2006IndependenceAD,
title={Independence and Domination Separation on Chessboard Graphs},
author={R. D. Chatham and M. Doyle and G. Fricke and J. Reitmann and R. Skaggs and M. Wolff},
year={2006}
}

A legal placement of Queens is any placement of Queens on an order N chessboard in which any two attacking Queens can be separated by a Pawn. The Queens independence separation number is the minimum number of Pawns which can be placed on an N ×N board to result in a separated board on which a maximum of m independent Queens can be placed. We prove that N + k Queens can be separated by k Pawns for large enough N and provide some results on the number of fundamental solutions to this problem. We… CONTINUE READING