Yes, by a probabilistic argument

No, counterexample: $G = K_n$ gives $\chi(G) = n, \chi(\overline{G}) = 1$, sum = $n+1$ which can be less than $2\sqrt{n}$ for large $n$

Yes, for all graphs

Only for regular graphs