| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651298 | Discrete Mathematics | 2006 | 5 Pages |
Abstract
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-12d-1.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
L. Sunil Chandran, T. Kavitha,