Circular chromatic number of the odd distance graph

The proof for $ \chi(G)\geq 5 $ has been recently extended to $ \chi_c(G)\geq 5 $, which implies the previous result, where $ \chi_c $ is the circular chromatic number.

Nicolas Roussel.

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options