An extension of the Prüfer code and assembly of connected graphs from their blocks (Q1401560)

A cut point of a connected graph is a vertex whose removal disconnects the graph. A block (in a graph theory context) is a connected graph with at least two vertices and no cut point. In this paper the author defines an extension of the Prüfer code to cater for any connected labeled graph that has more than two blocks. This code consists of an ordered sequence of cut points of the graph and a (non-ordered) set of the labeled blocks. The purpose of the paper is to describe a method for reconstructing the graph from its given set of blocks.