Meng-ru Lin

Let $T$ be a tree in which no vertex has degree $2$. A Halin graph is a planar graph obtained by connecting all leaves of $T$ into a cycle in their planar order. The idea of universal originates from a question of John W. Moon (1965). Consider all...