The purpose of this note is to characterize "block-graphs", a collection of graphs defined by a construction involving certain subgraphs called " blocks n . A related operation on a graph leads to the study of "cut-point-graphs 11 . The precise relationship between these two operations is made explicit. In order that this characterization be self-contained, we include the necessarydefinitions.