| Full text | |
| Author(s): |
Botler, F.
;
Mota, G. O.
;
Oshiro, M. T. I.
;
Wakabayashi, Y.
Total Authors: 4
|
| Document type: | Journal article |
| Source: | DISCRETE APPLIED MATHEMATICS; v. 245, p. 11-pg., 2018-08-20. |
| Abstract | |
Bark and Thomassen (2006) posed the following decomposition conjecture: for each tree T, there exists a natural number k(T) such that, if G is a k(T)-edge-connected graph and vertical bar E(G)vertical bar is divisible by vertical bar E(T)vertical bar, then G admits a decomposition into copies of T. In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. We verify this conjecture for paths of length 5. (C) 2016 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 11/08033-0 - Decomposition of a graph into paths: structural and algorithmic aspects |
| Grantee: | Fábio Happ Botler |
| Support Opportunities: | Scholarships in Brazil - Doctorate |
| FAPESP's process: | 13/11431-2 - Extremal and probabilistic combinatorics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/20733-2 - Extremal and probabilistic combinatorics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 14/01460-8 - Graph decompositions |
| Grantee: | Fábio Happ Botler |
| Support Opportunities: | Scholarships abroad - Research Internship - Doctorate |