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
Author: Zhai, SH
Lucchesi, CL
Guo, XF
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) [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. (C) 2009 Elsevier B.V. All rights reserved.
Subject: 1-extendable graphs
Removable ear
Excessive index
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/j.disc.2009.10.024
Date Issue: 2010
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000274126000018.pdf353.64 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.