On the edge-reconstruction of planar graphs

Stanley Fiorini · Mathematical Proceedings of the Cambridge Philosophical Society · 1978

Abstract The object of this paper is to prove that the following classes of graphs are edge-reconstructible: (i) 4-connected planar graphs with minimum valency 5; (ii) maximal planar graphs with minimum valency at least 4.

Read the paper · More papers on PaperTik