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...
Sábháilte in:
| Foilsithe in: | Revista de Matemática: Teoría y Aplicaciones |
|---|---|
| Príomhchruthaitheoir: | |
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Universidad de Costa Rica
2001
|
| Ábhair: | |
| Rochtain ar líne: | https://www.redalyc.org/articulo.oa?id=45379495005 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|