We give a sufficient and necessary condition for a finite graph to admit a tight and substantial polygonal map into the n-dimensional Euclidean space. As a consequence, we determine the curvature dimension for 2-connected graphs explicitly from their topological structure.
