Title

On The Edge-Reconstruction Of Graphs Embedded In Surfaces Iv

Keywords

Edge-reconstruction; Girth

Abstract

In this paper, by applying the discharging method, we give simple proofs that (1) every n-vertex graph with minimum degree at least 3 and girth at least 5 that is embeddable in a surface Σ of Euler characteristic at least-n/8 is edge-reconstructible, and (2) every n-vertex graph with minimum degree at least 4 that is embeddable without faces of length at most 3 in a surface Σ of Euler characteristic at least-n/6 is edge-reconstructible. © 2002 Elsevier Science B.V. All rights reserved.

Publication Date

2-28-2003

Publication Title

Discrete Mathematics

Volume

263

Issue

1-3

Number of Pages

331-338

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/S0012-365X(02)00792-6

Socpus ID

84867986992 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84867986992

This document is currently not available here.

Share

COinS