There are many incomparable graphs with respect to the homomorphism preorder, that is, graphs G, H such that G ↛ H and H ↛ G.
Examples of graphs with arbitrarily large values of odd girth and chromatic number are Kneser graphs and generalized Mycielskians.