Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-17T19:06:40.426Z Has data issue: false hasContentIssue false
  • English
  • Français

ON THE EDGE RECONSTRUCTION OF GRAPHS EMBEDDED IN SURFACES II

Published online by Cambridge University Press:  01 April 1998

YUE ZHAO
YUE ZHAO
Affiliation:
Box 138, Department of Mathematics and Computer Science, Benedict College, Columbia, South Carolina 29204–1086, USA
Get access

Abstract

In this paper, we prove the following theorems. (i) Let G be a graph of minimum degree δ[ges ]5. If G is embeddable in a surface σ and satisfies (δ−5)[mid ]V(G)[mid ]+6χ(σ)[ges ]0, then G is edge reconstructible. (ii) Any graph of minimum degree 4 that triangulates a surface is edge reconstructible. (iii) Any graph which triangulates a surface of characteristic χ[ges ]0 is edge reconstructible.

Type
Notes and Papers
Information
Journal of the London Mathematical Society , Volume 57 , Issue 2 , April 1998 , pp. 268 - 274
Copyright
The London Mathematical Society 1998

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.)