Add to ORKGIn 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
Bounds on the maximum and minimum degree of a graph establishing its reconstructibility from the ver...
AbstractGiven a simple graph G on n vertices, we prove that it is possible to reconstruct several al...
AbstractFor every infinite cardinal α, there exists a graph with α edges which is not uniquely recon...
AbstractIn this paper, by applying the discharging method, we give simple proofs that (1) every n-ve...
In this paper, by applying the discharging method, we give simple proofs that (1) every n-vertex gra...
AbstractIn this paper, by applying the discharging method, we give simple proofs that (1) every n-ve...
In 1942 Kelly conjectured that any finite, simple, undirected graph having at least 3 vertices is un...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
AbstractIt is shown that a graph with n vertices and more than n · log2n edges can be uniquely recon...
AbstractTutte (1979) proved that the disconnected spanning subgraphs of a graph can be reconstructed...
We prove that for every surface Σ of Euler genus g, every edgemaximal embedding of a graph in Σ is a...
The edge reconstruction number of a graph G, RN(G), is the minimum number of edge deleted subgraphs ...
AbstractWe show that there exists an absolute constant c such that any K1,m-free graph with the maxi...
AbstractAn edge e of a finite and simple graph G is called a fixed edge of G if G - e + e′ ≅ G impli...
Bounds on the maximum and minimum degree of a graph establishing its reconstructibility from the ver...
AbstractGiven a simple graph G on n vertices, we prove that it is possible to reconstruct several al...
AbstractFor every infinite cardinal α, there exists a graph with α edges which is not uniquely recon...
AbstractIn this paper, by applying the discharging method, we give simple proofs that (1) every n-ve...
In this paper, by applying the discharging method, we give simple proofs that (1) every n-vertex gra...
AbstractIn this paper, by applying the discharging method, we give simple proofs that (1) every n-ve...
In 1942 Kelly conjectured that any finite, simple, undirected graph having at least 3 vertices is un...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
AbstractIt is shown that a graph with n vertices and more than n · log2n edges can be uniquely recon...
AbstractTutte (1979) proved that the disconnected spanning subgraphs of a graph can be reconstructed...
We prove that for every surface Σ of Euler genus g, every edgemaximal embedding of a graph in Σ is a...
The edge reconstruction number of a graph G, RN(G), is the minimum number of edge deleted subgraphs ...
AbstractWe show that there exists an absolute constant c such that any K1,m-free graph with the maxi...
AbstractAn edge e of a finite and simple graph G is called a fixed edge of G if G - e + e′ ≅ G impli...
Bounds on the maximum and minimum degree of a graph establishing its reconstructibility from the ver...
AbstractGiven a simple graph G on n vertices, we prove that it is possible to reconstruct several al...
AbstractFor every infinite cardinal α, there exists a graph with α edges which is not uniquely recon...