The paper deals with a subfamily of those planar graphs which have outerplanar intersection of their MacLane cycle basis. These graphs have been known as Halin graphs. Their connectivity properties, structure of cycles, and feasible embeddings in the plane are discussed here. This paper also presents some initial investigations of NP-complete problems restricted to the family of Halin graphs.
CITATION STYLE
Sysło, M. M., & Proskurowski, A. (1983). On Halin graphs (pp. 248–256). https://doi.org/10.1007/bfb0071635
Mendeley helps you to discover research relevant for your work.