Suppose G is a graph. The minimum number of paths (trees, forests, linear forests, star forests, complete bipartite graphs, respectively) needed to decompose the edges of G is called the path number (tree number, arboricity, linear arboricity, star arbori
