Some results for chessboard separation problems
Paul A. Burchett, R. Douglas Chatham · AKCE International Journal of Graphs and Combinatorics · 2017
For a chessboard graph and a given graph parameter π, a π separation number is the minimum number of pawns for which some arrangement of those pawns on the board will produce a board where π has some desired value. We extend previous results on independence and domination separation. We also consider separation of other domination-related parameters.