On the Distribution of non-attacking Bishops on a Chessboard C
में बचाया:
| लेखक: | |
|---|---|
| स्वरूप: | artículo original |
| स्थिति: | Versión publicada |
| प्रकाशन तिथि: | 2001 |
| विवरण: | 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. |
| देश: | Portal de Revistas UCR |
| संस्थान: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| भाषा: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/197 |
| ऑनलाइन पहुंच: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/197 |
| संकेत शब्द: | bishop polynomials bipartite graphs matching chessboard polinomios de alfiles grafos bipartitos apareamiento tablero de ajedrez |