A graph which can be represented so that vertices correspond to points in the plane and edges correspond to unit-length line segments is called a unit-distance graph.

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.