Keywords
bipartite graphs
matching
chessboard
polinomios de alfiles
grafos bipartitos
apareamiento
tablero de ajedrez
How to Cite
Abstract
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.
References
Farrell, E.J.; Whitehead, E.G. Jr.(1992) “Connections between the matching and chromatic polynomials”, Internat. J. Math and Math. Sci. 15(4): 757–766.
Read, R.C. (1968) “An introduction to chromatic polynomials”, J. Combin. Theory 4: 52–71.
Riordan, J. (1980) An Introduction to Combinatorial Analysis. Princeton University Press, Princeton, New Jersey.
Sloane, N.J.A.; Plouffe, S. (1995) The Encyclopedia of Integer Sequences. Academic Press, London and New York.
Wahid, S.A. (1990) A Matrix Approach to Matching Polynomials. Ph.D. Thesis, University of the West Indies, St. Augustine, Trinidad, W.I.
Wahid, S.A. (1983) On the Matching Polynomials of Graphs. M. Phil. Thesis, University of the West Indies, St. Augustine, Trinidad, W.I.