AbstractFor every infinite cardinal α, there exists a graph with α edges which is not uniquely reconstructible from its family of edge-deleted subgraphs
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
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...
In 1942 Kelly conjectured that any finite, simple, undirected graph having at least 3 vertices is un...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
Reconstruction conjecture asks whether it is possible to reconstruct a unique (up to isomorphism) gr...
AbstractIt is shown that a graph with n vertices and more than n · log2n edges can be uniquely recon...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction number of a graph G, RN(G), is the minimum number of edge deleted subgraphs ...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
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...
In 1942 Kelly conjectured that any finite, simple, undirected graph having at least 3 vertices is un...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
Reconstruction conjecture asks whether it is possible to reconstruct a unique (up to isomorphism) gr...
AbstractIt is shown that a graph with n vertices and more than n · log2n edges can be uniquely recon...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction number of a graph G, RN(G), is the minimum number of edge deleted subgraphs ...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
DOI
Add to ORKG