A note on the number of graceful labellings of paths

DOI10.1016/S0012-365X(02)00458-2zbMath1008.05132MaRDI QIDQ1861279

Martin Širáň, R. E. L. Aldred, Jozef Širáň

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (12)

Triangular embeddings of complete graphs from graceful labellings of paths ⋮ Minimum genus embeddings of the complete graph ⋮ Computer search for graceful labeling: a survey ⋮ Counting graceful labelings of trees: a theoretical and empirical study ⋮ On graceful antimagic graphs ⋮ On the asymptotic growth of bipartite graceful permutations ⋮ Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) ⋮ Rook polynomials on two-dimensional surfaces and graceful labellings of graphs ⋮ Graceful labelling: state of the art, applications and future directions ⋮ Strong labelings of linear forests ⋮ Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)

This page was built for publication: A note on the number of graceful labellings of paths