Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
From MaRDI portal
Publication:1168334
DOI10.1016/0095-8956(82)90003-XzbMath0493.05045MaRDI QIDQ1168334
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
A survey on edge reconstruction of graphs, On the edge reconstruction of locally finite disconnected graphs with a finite number of components
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item