The rotation graph of k-ary trees is Hamiltonian
PublisherCrete University Press
Rights accessRestricted access - publisher's policy
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.
CitationHuemer, C.; Hurtado, F.; Pfeifle, J. The rotation graph of k-ary trees is Hamiltonian. A: European Workshop on Computational Geometry. "22nd European Workshop on Computational Geometry". Delphi: Crete University Press, 2006, p. 75-78.