In short,
Since Graph ($G$) does not contain any odd length cycle, So, $G$ is bipartite.
Chromatic number of Bipartite graph is at most $2.$
Since $G$ has at least two vertices and also $G$ is connected, So, $G$ has at least one edge, hence, $G$ cannot be colored with one color. So, answer will be $2.$