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...
Uloženo v:
| Vydáno v: | Revista de Matemática: Teoría y Aplicaciones |
|---|---|
| Hlavní autor: | |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Universidad de Costa Rica
2001
|
| Témata: | |
| On-line přístup: | https://www.redalyc.org/articulo.oa?id=45379495005 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|