An equitable partition into branchings in a digraph is a partition of the arc set into branchings such that the sizes of any two branchings differ at most by one. For a digraph whose arc set can be partitioned into $k$ branchings. there always exists an equitable partition into $k$ branchings. In this paper. https://www.chiggate.com/color-charm-050-cooling-violet-supply/