Abstract
A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by la k ( G ) , is the least number of linear k-forests needed to decompose G. In this paper, we completely determine la k ( G ) when G is a balanced complete bipartite graph K n , n or a complete graph K n , and k = 3 .
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.
