Minimum cycle bases of Halin graphs

Peter Florian Stadler · Journal of Graph Theory · 2003

Abstract Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003

Read the paper · More papers on PaperTik