\input zb-basic
\input zb-ioport
\iteman{io-port 05844244}
\itemau{Li, Yueping; Lou, Dingjun; Lu, Yunting}
\itemti{Algorithms for the optimal Hamiltonian path in Halin graphs.}
\itemso{Ars Comb. 87, 235-255 (2008).}
\itemab
Summary: This paper deals with construction of Hamiltonian paths of optimal weights in Halin graphs. There are three versions of the Hamiltonian path: none or one or two of the endvertices are specified. We present $O(\vert V\vert )$ algorithms to all the versions of the problem.
\itemrv{~}
\itemcc{}
\itemut{Halin graph; edge cutset; Hamiltonian path}
\itemli{}
\end