On the reconstruction of locally finite trees

DOI10.1002/jgt.3190050202zbMath0426.05038OpenAlexW2134044514MaRDI QIDQ3861436

Thomas Andreae

Publication date: 1981

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190050202

zbMATH Keywords

reconstruction of locally finite trees

Mathematics Subject Classification ID

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

Related Items (5)

Reconstruction of infinite locally finite connected graphs ⋮ An edge-deletion problem for locally finite graphs ⋮ Reconstruction of locally finite connected graphs with two infinite wings ⋮ Reconstruction of infinite graphs ⋮ Non-reconstructible locally finite graphs

Cites Work

• Reconstructing infinite graphs
• Unnamed Item

This page was built for publication: On the reconstruction of locally finite trees