If the cycle graph has even number of vertices ,then chromatic number =2
Matching number,i.e size of maximum matching = n/2 (by taking every alternate edge)
If the cycle graph has odd number of vertices ,then chromatic number =3
matching number ,by choosing alternate edge,we get = n/2-1
In both cases the answer is n+2