References
- A. Rosa. “On certain valuations of the vertices of a graph, in Theory of Graphs (Internat. Symposium, Rome, July, 1966”, Gordon and Breach, N. Y. and Dunod Paris, 1967, pp. 349-355.
- Douglas B. West. “Introduction to Graph Theory - Second edition”. Prentice Hall, 1996, 2001.
- K.M. Koh, D. G. Rogers and T. Tan. “On graceful trees”, Nanta Math. Vol. 10(2), 1997, pp. 27–31.
- P. Hrnciar and Alfonz Haviar. “All trees of diameter five are graceful”, Disc. Math, Vol. 233(1-3), 2000, pp. 133–150.
- R.E.L. Aldred and B.D. McKay. “Graceful and harmonious labelings of trees”, Bull. Inst. Combin. Appl, Vol. 23, 1998, pp. 69–72.
- Fang, W. A computational approach to the graceful tree conjecture. Accessed July 31, 2011. http://arxiv.org/abs/1003.3045.
- Gallian, J. A. “A Dynamic Survey of Graph Labeling”, The Electronic Journal of Combinatorics, Vol. 15. 2008, #DS6.
- Golomb S.W. “How to number a graph”, in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York, 1972, pp. 23-37.
- Horton, M. Graceful Trees: Statistics and Algorithms, Ph. D. Thesis, University of Tasmania, 2003.