We show that if the complete graph on n vertices, n ≥ 3, is edgecolored with m colors appearing so that no K3 subgraph is either monochromatic or rainbow and some color appears exactly once, then K2n-2 can be edge-colored with m colors appearing so that no K3 subgraph is either monochromatic or rainbow.