The binding number of Halin graphs
This paper deals with the concept ``binding number bind(G)'' of a graph \(G=(V,E)\) introduced by Woodall. The author shows that for every Halin graph H with n vertices the binding number bind(H) equals to (n-1)\(| (n-3)\) or to \((n+1)| (n-1)\). He finishes by giving a linear-time algorithm to find the binding number of a Halin graph of odd order different from a wheel.
scientific article; zbMATH DE number 4110747