Skip to main content Accessibility help
×
Home

ON THE EDGE RECONSTRUCTION OF GRAPHS EMBEDDED IN SURFACES II

  • YUE ZHAO (a1)

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.

Copyright

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed