Following the introduction of the notion of chromatic completion of a graph, this paper presents results for the chromatic completion number for the corona operations, P n • P m and P n •C m , n ≥ 1 and m ≥ 1. From the aforesaid a general result for the chromatic completion number of P n • K m came to the fore. The paper serves as a basis for further research with regards to the chromatic completion number of corona, join and other graph products.