Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||A lower bound on the number of removable ears of 1-extendable graphs|
|Abstract:||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)  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. (C) 2009 Elsevier B.V. All rights reserved.|
|Editor:||Elsevier Science Bv|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.