Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Let G$G$ be a simple graph and the length of the longest odd cycle of G$G$ is 2k+1$2k+1$,then I guess the chromatic number of G$G$ is no more than 2k+2$2k+2$,is it right?
Let G be a simple graph and the length of the longest odd cycle of G is 2k+1,then I guess the chromatic number of G is no more than 2k+2,is it right?
Let $G$ be a simple graph and the length of the longest odd cycle of $G$ is $2k+1$,then I guess the chromatic number of $G$ is no more than $2k+2$,is it right?
