The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever $\mathcal{D}(X)=\mathcal{D}(Y)$ then $X$ is homeomorphic to $Y$. It is shown that all metrizable compact connected spaces are reconstructible. It follows that all finite graphs, when viewed as a 1-dimensional cell-complex, are reconstructible in the topological sense, and more generally, that all compact graph-like spaces are reconstructible
A graph is {\it reconstructible} if it is determined by its {\it deck} of unlabeled subgraphs obtain...
We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for g...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
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...
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...
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of...
It is proved that decomposable graphs are set recognizable and that the index graph of the canonical...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
Collapsing cell complexes was first introduced in the 1930's as a way to deform a space into a topol...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...
AbstractIt is shown that the following classes of graphs are recognizable (i.e. looking at the point...
Let X be an infinite compact metrizable space having only a finite number of isolated points and Y b...
A graph is {\it reconstructible} if it is determined by its {\it deck} of unlabeled subgraphs obtain...
We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for g...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
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...
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...
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of...
It is proved that decomposable graphs are set recognizable and that the index graph of the canonical...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
Collapsing cell complexes was first introduced in the 1930's as a way to deform a space into a topol...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...
AbstractIt is shown that the following classes of graphs are recognizable (i.e. looking at the point...
Let X be an infinite compact metrizable space having only a finite number of isolated points and Y b...
A graph is {\it reconstructible} if it is determined by its {\it deck} of unlabeled subgraphs obtain...
We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for g...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...