https://scholars.lib.ntu.edu.tw/handle/123456789/30315
DC Field | Value | Language |
---|---|---|
dc.contributor | 李國偉 | zh_TW |
dc.contributor | 臺灣大學:數學研究所 | zh_TW |
dc.contributor.author | Huang, Wen-Chin | en |
dc.creator | 黃文進 | zh_TW |
dc.creator | Huang, Wen-Chin | en |
dc.date | 2005 | en |
dc.date.accessioned | 2007-11-28T02:28:33Z | - |
dc.date.accessioned | 2018-06-28T09:13:25Z | - |
dc.date.available | 2007-11-28T02:28:33Z | - |
dc.date.available | 2018-06-28T09:13:25Z | - |
dc.date.issued | 2005 | - |
dc.identifier | en-US | en |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/59508 | - |
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.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 | en |
dc.format.extent | 309689 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | en-US | en |
dc.language.iso | en_US | - |
dc.subject | 哈林圖 | en |
dc.subject | 漢彌爾頓迴圈 | en |
dc.subject | 毛毛蟲分解 | en |
dc.subject | Halin graph | en |
dc.subject | hamiltonian cycle | en |
dc.subject | caterpillar-forest decomposition | en |
dc.title | On the 1-edge Hamiltonicity and the caterpillar-forest decomposition of Halin graphs | en |
dc.type | thesis | en |
dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/59508/1/ntu-94-R91221018-1.pdf | - |
dc.relation.reference | 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. | en |
item.languageiso639-1 | en_US | - |
item.fulltext | with fulltext | - |
item.grantfulltext | open | - |
item.openairetype | thesis | - |
item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
item.cerifentitytype | Publications | - |
Appears in Collections: | 數學系 |
File | Description | Size | Format | |
---|---|---|---|---|
ntu-94-R91221018-1.pdf | 23.53 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.