The carvingwidth of hypercubes

@article{Chandran2006TheCO,
  title={The carvingwidth of hypercubes},
  author={L. Sunil Chandran and Telikepalli Kavitha},
  journal={Discrete Mathematics},
  year={2006},
  volume={306},
  pages={2270-2274}
}
The notion of the carvingwidth of a graph was introduced by Seymour and Thomas [Call routing and the ratcatcher, Combinatorica 14 (1994) 217–241]. In this note, we show that the carvingwidth of a d-dimensional hypercube equals 2d−1. © 2006 Elsevier B.V. All rights reserved.