In this thesis, we prove that the Halin graph which deletes anyone edge results in a hamiltonian graph, and design an algorithm to find all hamiltonian cycles of Halin graph. We also confirm that Halin graph can be decomposed into two caterpillar forests.
