NoteEvery 3-colorable graph has a faithful representation in the odd-distance graph

We prove that every finite 3-colorable graph has an odd-distance faithful representation in the plane. In other words, we can draw it in the plane so that any two vertices are connected by an edge if and only if their distance is an odd integer.