Reconstruction of pseudographs

Abstract

We prove that all graphs that admit loops and multiple edges are reconstructible if all graphs that admit multiple edges (multigraphs) and have 2-connected underlying graphs are reconstructible. Two very useful general results (Theorem 4.1 and Theorem 4.3) on finding the degree tuples of the deleted vertex and its neighbors in a multigraph from its deck are also proved.