Artículos de revistas
A weaker version of Lovasz' path removal conjecture
Registro en:
Journal Of Combinatorial Theory Series B. Academic Press Inc Elsevier Science, v. 98, n. 5, n. 972, n. 979, 2008.
0095-8956
WOS:000259099200003
10.1016/j.jctb.2007.11.003
Autor
Kawarabayashi, KI
Lee, O
Reed, B
Wollan, P
Institución
Resumen
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) We 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. 98 5 972 979 Japan Society for the Promotion of Science Grant-in-Aid for Scientific Research Inoue Research Award for Young Scientists Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) CNPq [490333/04-4, 2003/09925-5, 471460/2004-4]