Reconstructing 1-coherent locally finite trees
From MaRDI portal
Publication:1251236
DOI10.1007/BF02566101zbMath0391.05040MaRDI QIDQ1251236
Publication date: 1978
Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/139758
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 ⋮ Reconstruction of locally finite connected graphs with two infinite wings ⋮ Reconstruction of infinite graphs ⋮ Non-reconstructible locally finite graphs ⋮ On the edge reconstruction of locally finite disconnected graphs with a finite number of components
This page was built for publication: Reconstructing 1-coherent locally finite trees
