Abstract
We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possible, such that two different sets always have distance one.
Original language | English |
---|---|
Pages (from-to) | 17-19 |
Journal | Applied Mathematics Letters |
Volume | 6 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1993 |