an:06269007
Zbl 1297.05007
Adamaszek, Micha??
Efficient enumeration of graceful permutations
EN
J. Comb. Math. Comb. Comput. 87, 191-197 (2013).
00325935
2013
j
05A05 05A15 05C38
graceful \(n\)-permutations; enumeration
Summary: A graceful \(n\)-permutation is a graceful labeling of an \(n\)-vertex path \(P_n\). In this paper we improve the asymptotic lower bound on the number of such permutations from \(\Omega ((5/3)^n)\) to \(\Omega(2.37^n)\). This is a computer-assisted proof based on an effective algorithm that enumerates graceful \(n\)-permutations. Our algorithm is also presented in detail.