Bipartite matching-extendability of Halin graphs
Zhao Biao · Journal of Zhejiang University(Science Edition) · 2009
Let G be a connected graph containing a perfect matching.G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G.The main result is as follows: Halin graph H=(T∪C) is BM-extendable if and only if its characteristic tree T is isomorphic to K1,3,K1,5 or K1,7.