Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition

Xueliang Li, Fengxia Liu

The monochromatic tree partition number of an $r$-edge-colored graph $G$, denoted by $t_r(G)$, is the minimum integer $k$ such that whenever the edges of $G$ are colored with $r$ c…