Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T13:45:04.506Z Has data issue: false hasContentIssue false
  • English
  • Français

On the edge-reconstruction of planar graphs

Published online by Cambridge University Press:  24 October 2008

S. Fiorini
S. Fiorini
Affiliation:
Faculty of Mathematics, The Open University, England, and Department of Mathematics, University of Malta
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 83 , Issue 1 , January 1978 , pp. 31 - 35
Copyright
Copyright © Cambridge Philosophical Society 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1) Bondy, J. A. and Hemminger, R. L. Graph reconstruction – A survey. Research Report Corr 76–49, University of Waterloo (1977).Google Scholar
(2) Harary, F. Graph theory (Reading, Mass.: Addison-Welsey, 1969).CrossRefGoogle Scholar