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.
The second paper linked to in my answer proves that if $q$ is the smallest prime power larger than $2k$, then the chromatic number of $G_k$ is at most $q$.
You probably also want to bound the number of crossings, or have some other assumption like $k$-planarity. Otherwise, every graph can be drawn in the plane with crossings.
