Reconstruction of infinite graphs

DOI10.1016/0012-365X(91)90338-3zbMath0759.05066OpenAlexW2072255997MaRDI QIDQ1191922

C. St. J. A. Nash-Williams

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90338-3

zbMATH Keywords

reconstructioninfinite graphsedge-reconstructon

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

A survey on edge reconstruction of graphs ⋮ Reconstructing under group actions. ⋮ Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph ⋮ Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ Reconstruction of infinite locally finite connected graphs ⋮ Non-reconstructible locally finite graphs ⋮ Reconstructing the number of blocks of an infinite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A census of non-reconstructable digraphs. I: Six related families
• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstruction of locally finite connected graphs with two infinite wings
• Reconstructing infinite graphs
• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• Reconstructing 1-coherent locally finite trees
• Reconstructibility versus edge reconstructibility of infinite graphs
• Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
• A note on the line reconstruction problem
• Reconstructing the degree pair sequence of a digraph
• Reconstruction of locally finite connected graphs with at least three infinite wings
• Bidegreed graphs are edge reconstructible
• On the reconstruction of locally finite trees
• Note on the reconstruction of infinite graphs with a fixed finite number of components
• A Glance at Graph Theory-Part II
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• Reconstructing Graphs

This page was built for publication: Reconstruction of infinite graphs