A Weaker Version Of Lovász' Path Removal Conjecture

dc.creatorKawarabayashi K.
dc.creatorLee O.
dc.creatorReed B.
dc.creatorWollan P.
dc.date2008
dc.date2015-06-30T19:24:59Z
dc.date2015-11-26T14:30:05Z
dc.date2015-06-30T19:24:59Z
dc.date2015-11-26T14:30:05Z
dc.date.accessioned2018-03-28T21:33:22Z
dc.date.available2018-03-28T21:33:22Z
dc.identifier
dc.identifierJournal Of Combinatorial Theory. Series B. , v. 98, n. 5, p. 972 - 979, 2008.
dc.identifier958956
dc.identifier10.1016/j.jctb.2007.11.003
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49749149740&partnerID=40&md5=3ac6453e6a7624da4b9e683ad2479ebd
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/106131
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/106131
dc.identifier2-s2.0-49749149740
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1247013
dc.descriptionWe 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.
dc.description98
dc.description5
dc.description972
dc.description979
dc.descriptionChen, G., Gould, R., Yu, X., Graph connectivity after path removal (2003) Combinatorica, 23, pp. 185-203
dc.descriptionDiestel, R., (2005) Graph Theory. third ed., , Springer-Verlag
dc.descriptionKühn, D., Osthus, D., Partitions of graphs with high minimum degree or connectivity (2003) J. Combin. Theory Ser. B, 88, pp. 29-43
dc.descriptionJackson, B., Removable cycles in 2-connected graphs of minimum degree at least four (1980) J. London Math. Soc., 21 (3), pp. 385-392
dc.descriptionKawarabayashi, K., Lee, O., Yu, X., Non-separating paths in 4-connected graphs (2005) Ann. Comb., 9 (1), pp. 47-56
dc.descriptionKriesell, M., Induced paths in 5-connected graphs (2001) J. Graph Theory, 36, pp. 52-58
dc.descriptionKriesell, M., Removable paths conjectures, , http://www.fmf.uni-lj.si/~mohar/Problems/P0504Kriesell1.pdf
dc.descriptionLemos, M., Oxley, J., On removable cycles through every edge (2001) J. Graph Theory, 42 (2), pp. 155-164
dc.descriptionLovász, L., Problems in graph theory (1975) Recent Advances in Graph Theory, , Fielder M. (Ed), Acadamia Prague
dc.descriptionMader, W., Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte (1972) Abh. Math. Sem. Univ. Hamburg, 37, pp. 86-97
dc.descriptionMader, W., Kreuzungsfreie a, b-Wege in endlichen Graphen (1974) Abh. Math. Sem. Univ. Hamburg, 42, pp. 187-204
dc.descriptionMader, W., Topological minors in graphs of minimum degree n (1999) DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 49, pp. 199-211
dc.descriptionThomas, R., Wollan, P., An improved linear edge bound for graph linkages (2005) European J. Combin., 26, pp. 309-324
dc.descriptionThomassen, C., Non-separating cycles in k-connected graphs (1981) J. Graph Theory, 5, pp. 351-354
dc.descriptionThomassen, C., Graph decompositions with applications to subdivisions and path systems modulo k (1983) J. Graph Theory, 7, pp. 261-271
dc.descriptionThomassen, C., The Erdo{combining double acute accent}s Pósa property for odd cycles in graphs of large connectivity (2001) Combinatorica, 21, pp. 321-333
dc.languageen
dc.publisher
dc.relationJournal of Combinatorial Theory. Series B
dc.rightsfechado
dc.sourceScopus
dc.titleA Weaker Version Of Lovász' Path Removal Conjecture
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución