The subdivision graph of a graceful tree is a graceful tree

Koh, Rogers and Tan (Discrete Math. 25 (1979) 141–148) give a method to construct a bigger graceful tree from two graceful trees. Based upon their results, we give a new construction, which allows us to prove that the subdivision graph of a graceful tree is still a graceful tree.