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

Tien-Nam Le, Fiachra Knox, Moshe Rosenfeld. Every 3-colorable graph has a faithful representation in the odd-distance graph. Discrete Mathematics, 338(9):1614-1620, 2015. [doi]

Abstract

Abstract is missing.