A simpler counterexample to the reconstruction conjecture for denumerable graphs
From MaRDI portal
Publication:2550035
DOI10.1016/0095-8956(72)90026-3zbMath0229.05140OpenAlexW2093646058MaRDI QIDQ2550035
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90026-3
Related Items
Can colour-blind distinguish colour palettes?, Reconstructing the degree sequence and the number of components of an infinite graph, Graph theoretic models, Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs, What is reconstruction for ordered sets?, Counterexamples to the Edge Reconstruction Conjecture for infinite graphs, Unnamed Item, Reconstructing the number of blocks of an infinite graph
Cites Work