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...
Na minha lista:
| Publicado no: | Revista de Matemática: Teoría y Aplicaciones |
|---|---|
| Autor principal: | |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Universidad de Costa Rica
2001
|
| Assuntos: | |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=45379495005 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|