On the Distribution of non-attacking Bishops on a Chessboard C
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...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2001 |
| País: | Costa Rica |
| Institución: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Idioma: | español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/197 |
| Acceso en línea: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/197 |
| Access Level: | acceso abierto |
| Palabra clave: | bishop polynomials bipartite graphs matching chessboard polinomios de alfiles grafos bipartitos apareamiento tablero de ajedrez |
| Sumario: | 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. |
|---|