On the Distribution of non-attacking Bishops on a Chessboard C

Shanaz Ansari Wahid
2012 Revista de Matemática: Teoría y Aplicaciones  
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.
doi:10.15517/rmta.v8i1.197 fatcat:snp7zje32jgrbpurmfdxrlnrle