|Title:||On the 1-edge Hamiltonicity and the caterpillar-forest decomposition of Halin graphs||Authors:||Huang, Wen-Chin||Keywords:||哈林圖;漢彌爾頓迴圈;毛毛蟲分解;Halin graph;hamiltonian cycle;caterpillar-forest decomposition||Issue Date:||2005||Abstract:||null
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.
|Appears in Collections:||數學系|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.