A Note on l1-rigid Planar Graphs

In this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph anddGthe usual path metric ofG. By a hypercube we mean the edge graphHqof theq-dimensional binary cube. The path metricdHofHqis simply the Hamming distance.