Let G be a 1-extendable graph distinct from K-2 and C-2n. A classical result of Lovasz and Plummer(1986) 15,Theorem 5.4.6] states that G has a removable ear. Carvalho et al. (1999) [3] proved that G has at least Delta(G) edge-disjoint removable ears, where Delta(G) denotes the maximum degree of G. In this paper, the authors improve the lower bound and prove that G has at least m(G) edge-disjoint removable ears, where m(G) denotes the minimum number of perfect matchings needed to cover all edges of G.
展开▼
机译：令G为不同于K-2和C-2n的1个可扩展图。 Lovasz and Plummer（1986）15，Theorem 5.4.6]的经典结果指出，G有可移动的耳朵。 Carvalho等。 （1999）[3]证明G至少具有Delta（G）边缘不相交的可移动耳朵，其中Delta（G）表示G的最大程度。在本文中，作者改进了下界并证明G具有至少m（G）个边缘不相交的可移动耳朵，其中m（G）表示覆盖G的所有边缘所需的最小匹配数目。
展开▼
