Canad. Math. Bull. 52(2009), 416-423
Printed: Sep 2009
Ahmad Mahmood Qureshi
A Halin graph is a graph $H=T\cup C$, where $T$ is a tree with no
vertex of degree two, and $C$ is a cycle connecting the end-vertices
of $T$ in the cyclic order determined by a plane embedding of $T$.
In this paper, we define classes of generalized Halin graphs, called
$k$-Halin graphs, and investigate their Hamiltonian properties.
$k$-Halin graph, Hamiltonian, Hamiltonian connected, traceable
05C45 - Eulerian and Hamiltonian graphs
05C38 - Paths and cycles [See also 90B10]