Aldred, R.; Siran, M. and Siran, J.
|DOI (Digital Object Identifier) Link:||http://dx.doi.org/10.1016/S0012-365X(02)00458-2|
|Google Scholar:||Look up in Google Scholar|
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.
|Item Type:||Journal Article|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics|
|Depositing User:||Jozef Širáň|
|Date Deposited:||14 Jun 2007|
|Last Modified:||02 Dec 2010 20:00|
Actions (login may be required)
|Report issue / request change|