李國偉臺灣大學:數學研究所Huang, Wen-ChinWen-ChinHuang2007-11-282018-06-282007-11-282018-06-282005http://ntur.lib.ntu.edu.tw//handle/246246/59508In 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.1。 Introduction P.4 2。 The 1-edge hamiltonicity algorithm for Halin graphs P.8 3。 On the 1-edge hamiltonicity of Halin graphs P.14 4。 Caterpillar-forest decomposition P.19 5。 Conclusion and future work P.28309689 bytesapplication/pdfen-US哈林圖漢彌爾頓迴圈毛毛蟲分解Halin graphhamiltonian cyclecaterpillar-forest decompositionOn the 1-edge Hamiltonicity and the caterpillar-forest decomposition of Halin graphsthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/59508/1/ntu-94-R91221018-1.pdf