| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777594 | Journal of Combinatorial Theory, Series B | 2017 | 12 Pages |
Abstract
As a corollary, the tree-width of any graph G that does not contain k vertex-disjoint cycles of length at least l is of order O(kl+klogâ¡k). This is also optimal up to constant factors and answers another question of Birmelé, Bondy, and Reed (2007).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
F. Mousset, A. Noever, N. Å koriÄ, F. Weissenberger,