Find in Library

It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching polynomial of a bipartite graph. Reduction algorithms for finding the bishop polynomial of C are given. We interpret combinatorially the coefficients of this polynomial and construct some interesting boards. Some applications of the bishop polynomials are given.