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 board graph, and the board graph is a bipartite permutation graph. Thus, the rook problem on STCs can be solved by any algorithm for solving the edge domination problem on bipartite permutation graphs.
