×

Hamiltonian cycles in skirted trees. (English) Zbl 0719.05045

Summary: A skirted tree can be obtained from a Halin graph by subdividing some of its interior edges. We characterize Hamiltonian skirted trees and those trees which can be interior trees of Hamiltonian skirted trees. Both characterizations are algorithmic and provide polynomial-time recognition algorithms for Hamiltonian skirted trees.

MSC:

05C45 Eulerian and Hamiltonian graphs
05C05 Trees
PDFBibTeX XMLCite