On the Distribution of non-attacking Bishops on a Chessboard C
Guardado en:
| Forfatter: | |
|---|---|
| Format: | artículo original |
| Status: | Versión publicada |
| Fecha de Publicación: | 2001 |
| Beskrivelse: | 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. |
| País: | Portal de Revistas UCR |
| Institution: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Sprog: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/197 |
| Online adgang: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/197 |
| Palabra clave: | bishop polynomials bipartite graphs matching chessboard polinomios de alfiles grafos bipartitos apareamiento tablero de ajedrez |