


























In this article the cyclic cutwidth of the $n$-dimensional cube is explored. It has been conjectured by Dr. Chavez and Dr. Trapp that the cyclic cutwidth of $Q_n$ is minimized with the Graycode numbering. Several results have been found toward the proof of this conjecture.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。