A note on the number of graceful labellings of paths Original Research Article
Author/Authors :
R.E.L. Aldred، نويسنده , , Jozef ?ir??، نويسنده , , Martin ?ir??، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Pages :
4
From page :
27
To page :
30
Abstract :
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.
