Notes: 61.20 Using graphs to count logic block chains
| Autor: | Derek G. Ball |
|---|---|
| Rok vydání: | 1977 |
| Předmět: | |
| Zdroj: | The Mathematical Gazette. 61:288-290 |
| ISSN: | 2056-6328 0025-5572 |
| DOI: | 10.2307/3617405 |
| Popis: | Last summer a colleague of mine suggested a counting problem which I eventually solved by a curious method involving the counting of subgraphs. The problem was to find the number of different ways of arranging twelve Dienes logic blocks which differ only in shape and colour in a closed chain, in such a way that there is one difference in attribute between each pair of neighbouring pieces in the chain. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|