Now showing items 1-1 of 1
The class reconstruction number of maximal planar graphs
(Springer-Verlag, 1987-12)
The reconstruction number rn(G) of a graph G was introduced by Harary and Plantholt as the smallest number of vertex-deleted subgraphs G i = G − v i in the deck of G which do not all appear in the deck of any other graph. ...