The graphs with no equilateral triangles. (English) Zbl 0606.05060
Motivated by a theorem on distance geometry, it is shown that a graph has no equilateral triangles if and only if every component is either a path or a cycle the length of which is not divisible by three.
MSC:
05C99 | Graph theory |