| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427893 | Information Processing Letters | 2008 | 6 Pages |
Abstract
In this paper we show that the graph of k-ary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for k-ary trees. Furthermore, we identify a basic building block of this graph as the 1-skeleton of the polytopal complex dual to the lower faces of a certain cyclic polytope.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
