An H-WORM coloring of a simple graph G is the coloring of the vertices of G such that no copy of H b G is monochrome or rainbow. In a recently published article by one of the authors [3], it was claimed that the number of r-partitions in a Ks-WORM coloring of Kn is C_n rž, where ™n rž denotes the Stirling number of the second kind, for all 3 B r B s n. We found that C_n r if and only if n3 2  s B n with r s. Further investigations into 2, given any K3-WORM coloring of Kn, show its relation with the number of spanning trees of cacti and the Catalan numbers. Moreover, we extend the notion of H-WORM colorings to ˆH1;H2-mixed colorings, where H1 and H2 are distinct subgraphs of G; these coloring constraints are closely related to those of mixed hypergraph colorings.