Edges that are the unique chords of at least one cycle have been studied by a variety of authors over the past dozen years. This paper begins the study of those graphs in which each edge is the unique chord of exactly one cycle. The 3-connected planar graphs that enjoy this restriction are characterized by two infinite sequences (the dipyramid and trapezohedron 3-polytopes) together with three special graphs (the 4-antiprism, and the 5- and 6-prism graphs).