On the 1-edge Hamiltonicity and the caterpillar-forest decomposition of Halin graphs
碩士 === 國立臺灣大學 === 數學研究所 === 93 === 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....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/58821114271899149891 |