No CrossRef data available.
Published online by Cambridge University Press: 22 September 2016
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.
Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.
* Views captured on Cambridge Core between 22nd September 2016 - 24th January 2021. This data will be updated every 24 hours.