Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"reconstruction conjecture"”.
-
The Reconstruction Conjecture in Graph Theory
… we explore the relationship between the reconstruction and edge-reconstruction conjectures; we prove that several classes of graphs are actually Harary to the reconstructible; and we give counterexamples reconstruction and edge-reconstruction conjectures for infinite graphs.
-
Selected Applications of the Nash-Williams Lemma
… graph theory that are associated with the Edge Reconstruction Conjecture along with a formal statement and proof of the Nash-Williams Lemma. Reconstructibility conditions concerned with comparing the size and order of general graphs will then be established with an in depth look at conditions …
-
Reconstructing a graph from its edge-contractions
In this thesis, we investigate the contraction reconstruction conjecture. It states that all simple graphs with at least four edges are reconstructible, that is they are uniquely determined from their collection of single edge contraction minors, called the deck. Similar questions have been studied …
-
Graph reconstruction and structure
… in some settings.</p> <p>The famous Graph Reconstruction Conjecture (Kelly-Ulam, 1941) states that every graph on at least 3 vertices is uniquely determined by its deck of vertex-deleted subgraphs. Despite sustained efforts, it remains wide open. In Part I, we break new ground on several …
-
Topological reconstruction and compactification theory
<p>This thesis investigates the topological reconstruction problem, which is inspired by the reconstruction conjecture in graph theory. We ask how much information about a topological space can be recovered from the homeomorphism types of its point-complement subspaces. If the whole space can be …
-
On some problems in reconstruction
… a {\it card} is one of these subgraphs. The {\it Reconstruction Conjecture} asserts that all graphs with at least three vertices are reconstructible. In Chapter $2$ we consider $k$-deck reconstruction of graphs. The {\it $k$-deck} of a graph is its multiset of $k$-vertex induced subgraphs. We …