Reconstruction of infinite locally finite connected graphs

DOI10.1016/S0012-365X(02)00867-1zbMath1024.05062MaRDI QIDQ1406548

Norbert Polat, Marc Chastand

Publication date: 4 September 2003

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

Mathematics Subject Classification ID

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

Related Items (2)

Fixed finite subgraph theorems in infinite weakly modular graphs ⋮ Reconstructing the number of blocks of an infinite graph

Cites Work

• Unnamed Item
• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstruction of infinite graphs
• Reconstructing infinite graphs
• Reconstructing 1-coherent locally finite trees
• A note on Menger's theorem for infinite locally finite graphs
• Ends and multi-endings. I
• Invariant subgraph properties in pseudo-modular graphs
• Über unendliche Wege in Graphen
• Reconstruction of locally finite connected graphs with at least three infinite wings
• On the reconstruction of locally finite trees
• Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
• Wurzelbäume und unendliche Wege in Graphen

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