Title
On the edge-reconstruction of graphs embedded in surfaces IV
Abbreviated Journal Title
Discret. Math.
Keywords
edge-reconstruction; girth; Mathematics
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 Sigma 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 Sigma of Euler characteristic at least -n/6 is edge-reconstructible. (C) 2002 Elsevier Science B.V. All rights reserved.
Journal Title
Discrete Mathematics
Volume
263
Issue/Number
1-3
Publication Date
1-1-2003
Document Type
Article
Language
English
First Page
331
Last Page
338
WOS Identifier
ISSN
0012-365X
Recommended Citation
"On the edge-reconstruction of graphs embedded in surfaces IV" (2003). Faculty Bibliography 2000s. 4155.
https://stars.library.ucf.edu/facultybib2000/4155
Comments
Authors: contact us about adding a copy of your work at STARS@ucf.edu