The Existence of a Hamilton Circuit in a Tree Graph

The existence of a Hamilton circuit in a tree graph was first proved by Cummins.[1] However, his proof is hard to apply to the generation of all the trees in a given graph. A new proof is given in this paper; it is straightforward and concise, and also constructive and applicable to the tree generation. The outline of a tree generation procedure is shown.