哈林图的导出匹配可扩性（英文）

作者：张庆楠; 惠志昊^*; 杨雨; 王安

来源：数学季刊, 2022, 37(04): 380-385.

DOI：10.13371/j.cnki.chin.q.j.m.2022.04.005

Let G be a connected graph having a perfect matching. The graph G is said to be induced matching(IM) extendable if every induced matching M of G is contained in a perfect matching of G. In this paper, we show that Halin graph G = T ∪ C is IM-extendable if and only if its characteristic tree T is isomorphic to K1,3, K1,5, K1,7 or S2,2.