Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs

DOI10.1016/0095-8956(82)90003-XzbMath0493.05045MaRDI QIDQ1168334

Thomas Andreae

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

edge reconstructioncountable forest

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 ⋮ On the edge reconstruction of locally finite disconnected graphs with a finite number of components

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstructibility versus edge reconstructibility of infinite graphs
• Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
• A simpler counterexample to the reconstruction conjecture for denumerable graphs
• Note on the reconstruction of infinite graphs with a fixed finite number of components
• Graph reconstruction—a survey
• A counterexample to the countable version of a conjecture of Ulam

This page was built for publication: Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs