This paper investigates topological reconstruction, related to the reconstruction conjecture in graph theory. We ask whether the homeomorphism types of subspaces of a space X which are obtained by deleting singletons determine X uniquely up to homeomorphism. If the question can be answered affirmatively, such a space is called reconstructible. We prove that in various cases topological properties can be reconstructed. As main result we find that familiar spaces such as the reals '', the rationals '' and the irrationals '' are reconstructible, as well as spaces occurring as Stone-Čech compactifications. Moreover, some non-reconstructible spaces are discovered, amongst them the Cantor set C
In 1942 Kelly conjectured that any finite, simple, undirected graph having at least 3 vertices is un...
It is proved that decomposable graphs are set recognizable and that the index graph of the canonical...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...
This paper investigates topological reconstruction, related to the reconstruction conjecture in grap...
This thesis investigates the topological reconstruction problem, which is inspired by the reconstruc...
The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\...
The deck, D(X), of a topological space X is the set D(X) = {[X\{x}]: x ∈ X}, where [Y] denotes the h...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of...
Reconstruction conjecture asks whether it is possible to reconstruct a unique (up to isomorphism) gr...
This doctoral thesis deals with the reconstruction conjecture in graph theory. This over 70 year old...
In this note we shall show that the Graph Reconstruction Conjecture (also called the Kelly-Ulam conj...
AbstractTutte (1979) proved that the disconnected spanning subgraphs of a graph can be reconstructed...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
Some classes of digraphs are reconstructed from the point-deleted subdigraphs for each of which the ...
In 1942 Kelly conjectured that any finite, simple, undirected graph having at least 3 vertices is un...
It is proved that decomposable graphs are set recognizable and that the index graph of the canonical...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...
This paper investigates topological reconstruction, related to the reconstruction conjecture in grap...
This thesis investigates the topological reconstruction problem, which is inspired by the reconstruc...
The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\...
The deck, D(X), of a topological space X is the set D(X) = {[X\{x}]: x ∈ X}, where [Y] denotes the h...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of...
Reconstruction conjecture asks whether it is possible to reconstruct a unique (up to isomorphism) gr...
This doctoral thesis deals with the reconstruction conjecture in graph theory. This over 70 year old...
In this note we shall show that the Graph Reconstruction Conjecture (also called the Kelly-Ulam conj...
AbstractTutte (1979) proved that the disconnected spanning subgraphs of a graph can be reconstructed...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
Some classes of digraphs are reconstructed from the point-deleted subdigraphs for each of which the ...
In 1942 Kelly conjectured that any finite, simple, undirected graph having at least 3 vertices is un...
It is proved that decomposable graphs are set recognizable and that the index graph of the canonical...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...