Abstract
We study the decomposition conjecture posed by Barát and Thomassen (2006), which states that, for each tree T, there exists a natural number kT such that, if G is a kT-edge-connected graph and |E(T)| divides |E(G)|, then G admits a partition of its edge set into classes each of which induces a copy of T. In a series of papers, starting in 2008, Thomassen has verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. In this paper we verify this conjecture for paths of length 5.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
