Partitioning complete multipartite graph
โ
Atsushi Kaneko; M. Kano; Kazuhiro Suzuki
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 102 KB
The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K (n 1 ; n 2 ; . . . ; n k )) of the c