论文信息 - A note on the number of graceful labellings of paths

A note on the number of graceful labellings of paths

With the help of a simple recursive construction we give a computer-assisted proof that the number of graceful labellings of a path of length n grows asymptotically at least as fast as (5/3)n. Results of this type have found surprising applications in topological graph theory.

[1] Jozef Širáň,et al. Bipartite labeling of trees with maximum degree three , 1999 .

[2] Alexander Rosa,et al. Bipartite labelings of trees and the gracesize , 1995, J. Graph Theory.

[3] G. Ringel. Map Color Theorem , 1974 .