Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A Weaker Version Of Lovász' Path Removal Conjecture
Author: Kawarabayashi K.
Lee O.
Reed B.
Wollan P.
Abstract: We prove there exists a function f (k) such that for every f (k)-connected graph G and for every edge e ∈ E (G), there exists an induced cycle C containing e such that G - E (C) is k-connected. This proves a weakening of a conjecture of Lovász due to Kriesell. © 2008 Elsevier Inc. All rights reserved.
Rights: fechado
Identifier DOI: 10.1016/j.jctb.2007.11.003
Date Issue: 2008
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-49749149740.pdf180.43 kBAdobe PDFView/Open

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