Zhejiang Daxue xuebao. Lixue ban (Sep 2009)

哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)

  • HUIZhi-hao(惠志昊),
  • ZHAOBiao(赵飚)

DOI
https://doi.org/10.3785/j.issn.1008-9497.2009.05.002
Journal volume & issue
Vol. 36, no. 5
pp. 493 – 496

Abstract

Read online

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.

Keywords