請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/35578完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 李國偉(Ko-Wei Lih) | |
| dc.contributor.author | Wen-Chin Huang | en |
| dc.contributor.author | 黃文進 | zh_TW |
| dc.date.accessioned | 2021-06-13T06:59:21Z | - |
| dc.date.available | 2005-08-01 | |
| dc.date.copyright | 2005-08-01 | |
| dc.date.issued | 2005 | |
| dc.date.submitted | 2005-07-28 | |
| dc.identifier.citation | J. A. Bondy and L. Lov'asz,
Lengths of cycles in Halin graphs, J.Graph Theory (1985), 397--410. A. V. Kostochka and D. B. West, Every outerplanar graph is the union of two interval graphs, Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999). Congr. Numer.139 (1999), 5--8. D. Lou and H. Zhu, A note on max-leaves spanning tree problem in Halin graphs. Australas. J. Combin. 29 (2004), 95--97. M. M. Syslo and A. Proskurowski, On Halin graphs, Graph theory Lagacuteow, (1981), 248--256, Lecture Notes in Math., 1018, Spring, Berlin,1983. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932), 150--168. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/35578 | - |
| dc.description.abstract | 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. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T06:59:21Z (GMT). No. of bitstreams: 1 ntu-94-R91221018-1.pdf: 309689 bytes, checksum: 4352e98f9262b9f3187ec6b7b5a1fd92 (MD5) Previous issue date: 2005 | en |
| dc.description.tableofcontents | 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.28 | |
| dc.language.iso | en | |
| dc.subject | 毛毛蟲分解 | zh_TW |
| dc.subject | 漢彌爾頓迴圈 | zh_TW |
| dc.subject | 哈林圖 | zh_TW |
| dc.subject | hamiltonian cycle | en |
| dc.subject | caterpillar-forest decomposition | en |
| dc.subject | Halin graph | en |
| dc.title | On the 1-edge Hamiltonicity and the caterpillar-forest
decomposition of Halin graphs | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 93-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 張鎮華,董立大 | |
| dc.subject.keyword | 哈林圖,漢彌爾頓迴圈,毛毛蟲分解, | zh_TW |
| dc.subject.keyword | Halin graph,hamiltonian cycle,caterpillar-forest decomposition, | en |
| dc.relation.page | 29 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2005-07-28 | |
| dc.contributor.author-college | 理學院 | zh_TW |
| dc.contributor.author-dept | 數學研究所 | zh_TW |
| 顯示於系所單位： | 數學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-94-1.pdf 未授權公開取用 | 302.43 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。