par Fiorini, Samuel ;Herinckx, Audrey
Référence Journal of graph theory, 77, 2, page (111-116)
Publication Publié, 2014
Article révisé par les pairs
Résumé : We prove that there exists a bivariate function f with f(k,)= O(·klogk) such that for every natural k and , every graph G has at least k vertex-disjoint cycles of length at least or a set of at most f(k,) vertices that meets all cycles of length at least . This improves a result by Birmelé et al. (Combinatorica, 27 (2007), 135-145), who proved the same result with f(k,)=Θ(·k2). © 2013 Wiley Periodicals, Inc.

Documents en relation

DI-fusion