Reconstruction of locally finite connected graphs with two infinite wings

DOI10.1016/0012-365X(91)90284-9zbMath0746.05046OpenAlexW2000011782MaRDI QIDQ1182943

C. St. J. A. Nash-Williams

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90284-9

zbMATH Keywords

reconstructioninfinite wingslocally finite connected graphs

Mathematics Subject Classification ID

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

Related Items (2)

Reconstruction of infinite graphs ⋮ Non-reconstructible locally finite graphs

Cites Work

• Unnamed Item
• Hypomorphisms, orbits, and reconstruction
• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstructing infinite graphs
• Reconstructing 1-coherent locally finite trees
• Reconstruction of locally finite connected graphs with at least three infinite wings
• On the reconstruction of locally finite trees

This page was built for publication: Reconstruction of locally finite connected graphs with two infinite wings