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 .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
