1. CMB 2009 (vol 52 pp. 416)
|Hamiltonian Properties of Generalized Halin Graphs |
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.
Keywords:$k$-Halin graph, Hamiltonian, Hamiltonian connected, traceable