A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The rook problem on saw-toothed chessboards
2008
Applied Mathematics Letters
Preserved Fulltext
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j) can dominate the squares in row i and in column j. The rook problem of an STC is to determine the minimum number of rooks that can dominate all squares of the STC. In this paper, we model an STC by two particular graphs: a rook graph and a board graph. We show that for an STC, the rook graph is the line graph of the
doi:10.1016/j.aml.2007.12.003
fatcat:meh5pxo6cbdjzm4ufgigexhau4