A graph with a graceful labeling (an \(\alpha\)-labeling) is called a graceful (\(\lambda\)-graceful) graph. In this paper, six methods for constructing bigger graceful graphs from a given graceful graph or a set of given \(\lambda\)-graceful graphs are provided. Two of which generalize Koh and others’ Theorems in [2, 3].