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:archivo.portal.ucr.ac.cr:article/197 |
| Online-ссылка: | https://archivo.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 |