A weaker version of Lovasz' path removal conjecture

dc.creatorKawarabayashi, KI
dc.creatorLee, O
dc.creatorReed, B
dc.creatorWollan, P
dc.date2008
dc.dateSEP
dc.date2014-11-16T21:53:38Z
dc.date2015-11-26T17:26:58Z
dc.date2014-11-16T21:53:38Z
dc.date2015-11-26T17:26:58Z
dc.date.accessioned2018-03-29T00:14:08Z
dc.date.available2018-03-29T00:14:08Z
dc.identifierJournal Of Combinatorial Theory Series B. Academic Press Inc Elsevier Science, v. 98, n. 5, n. 972, n. 979, 2008.
dc.identifier0095-8956
dc.identifierWOS:000259099200003
dc.identifier10.1016/j.jctb.2007.11.003
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/53964
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/53964
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/53964
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1284681
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionWe prove there exists a function f (k) such that for every f (k)-connected graph G and for every edge e epsilon 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 Lovasz due to Kriesell. (C) 2008 Elsevier Inc. All rights reserved.
dc.description98
dc.description5
dc.description972
dc.description979
dc.descriptionJapan Society for the Promotion of Science
dc.descriptionGrant-in-Aid for Scientific Research
dc.descriptionInoue Research Award for Young Scientists
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionCNPq [490333/04-4, 2003/09925-5, 471460/2004-4]
dc.languageen
dc.publisherAcademic Press Inc Elsevier Science
dc.publisherSan Diego
dc.publisherEUA
dc.relationJournal Of Combinatorial Theory Series B
dc.relationJ. Comb. Theory Ser. B
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectgraph connectivity
dc.subjectremovable paths
dc.subjectnon-separating cycles
dc.subjectMinimum Degree
dc.subjectGraphs
dc.subjectConnectivity
dc.subjectCycles
dc.titleA weaker version of Lovasz' path removal conjecture
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución