On the edge reconstruction of locally finite disconnected graphs with a finite number of components

DOI10.1007/BF02941501zbMath0585.05024MaRDI QIDQ1071035

Thomas Andreae

Publication date: 1985

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

edge-reconstructioninfinite graphslocally finite graphinfinite disconnected graphs

Mathematics Subject Classification ID

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

Related Items (2)

A survey on edge reconstruction of graphs ⋮ An edge-deletion problem for locally finite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
• An edge-deletion problem for locally finite graphs
• Reconstructing infinite graphs
• Reconstructing 1-coherent locally finite trees
• Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
• Graph reconstruction—a survey

This page was built for publication: On the edge reconstruction of locally finite disconnected graphs with a finite number of components