A loopless Gray code for rooted trees
James F. Korsh, Paul S. LaFollette · ACM Transactions on Algorithms · 2006
Beyer and Hedetniemi [1980] gave the first constant average-time algorithm for the generation of all rooted trees with n nodes. This article presents the first combinatorial Gray code for these trees and a loopless algorithm for its generation.