We introduce the concept of molds, which together with an appropriate weight function, gives all the information of a regular tournament. We use the molds to give a shorter proof of the characterization of domination graphs than the one given in \([4, 5]\), We also use the molds to give a lower and an upper bound of the dichromatic number for all regular tournaments with the same mold.