A solution for the coloured cubes problem

J. M. Basart, P. Guitart

    Research output: Contribution to journalArticleResearchpeer-review


    Let C be any set of q cubes in which every face in each one of them has to be coloured using one colour in a set K of q colours. It is asked how to raise, if it is possible, a pile with the q cubes in such a way that every colour will appear once in every one of the four faces of the pile. The case q = 4 was solved long time ago. Now, an answer is presented for the general case by means of an efficient algorithm. This method is based on a particular linear program which always produces integer solutions. © 1999 Elsevier Science B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)171-176
    JournalTheoretical Computer Science
    Issue number1-2
    Publication statusPublished - 28 Aug 1999


    • Combinatorial problems
    • Graph applications
    • Linear programming


    Dive into the research topics of 'A solution for the coloured cubes problem'. Together they form a unique fingerprint.

    Cite this