A cube-covering problem.

zbMATH Open1289.52023MaRDI QIDQ2846641FDOQ2846641

Authors Yonghui Fan, Flávio K. Miyazawa, Yuqin Zhang

Publication date 9 September 2013

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

cubegeometric coveringside length

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Recommendations

• Covering a unit hypercube with hypercubes.
• A cube-packing problem
• A note on a cube-packing problem
• Covering the 3-dimensional unit cube by six rectangular boxes
• A sufficient condition for the covering of the unit cube by homothetic copies in the \(n\)-dimensional Euclidean space

Cited in

(7)

• A sufficient condition for the covering of the unit cube by homothetic copies in the \(n\)-dimensional Euclidean space
• A stability theorem on cube tessellations
• Covering a cube with holes by strips
• On coverings of tori with cubes
• A note on a cube-packing problem
• Covering a unit hypercube with hypercubes.
• A cube-packing problem

This page was built for publication: A cube-covering problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846641)