Reconstruction of infinite locally finite connected graphs

DOI10.1016/S0012-365X(02)00867-1MaRDI QIDQ1406548zbMATH OpenFDO

Authors Marc Chastand, Norbert Polat

Publication date 4 September 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(02)00867-1

Mathematics Subject Classification ID

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

Review text

The authors continue previous work of Bondy and Hemminger, Thomassen, Andreae, and Nash-Williams on the reconstruction of infinite locally finite connected graphs; see \textit{C. St. J. A. Nash-Williams} [Discrete Math. 95, 221-229 (1991; Zbl 0759.05066)] for a survey. The authors' investigations are based on the concept of order of an end which was introduced by \textit{H. A. Jung} [Math. Nachr. 41, 1-22 (1969; Zbl 0177.27001)]. The main result is that a locally finite connected graph is reconstructible if it contains no end-respecting subdivision of the dyadic tree and if it has at least two ends of maximal order.

Recommendations

• Reconstruction of infinite graphs
• Reconstruction of locally finite connected graphs with two infinite wings
• The reconstruction problem for certain infinite graphs
• Reconstruction of locally finite connected graphs with at least three infinite wings
• Almost reconstructing infinite, rayless graphs
• On the edge reconstruction of locally finite disconnected graphs with a finite number of components
• Non-reconstructible locally finite graphs
• scientific article; zbMATH DE number 3853124
• On the reconstruction of graph invariants
• scientific article; zbMATH DE number 883277

Cites work

• A note on Menger's theorem for infinite locally finite graphs
• Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
• Ends and multi-endings. I
• scientific article; zbMATH DE number 3775572 (Why is no real title available?)
• Invariant subgraph properties in pseudo-modular graphs
• On the reconstruction of locally finite trees
• Reconstructing 1-coherent locally finite trees
• Reconstructing infinite graphs
• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstruction of infinite graphs
• Reconstruction of locally finite connected graphs with at least three infinite wings
• Wurzelbäume und unendliche Wege in Graphen
• Über unendliche Wege in Graphen

Cited in

(12)

• On the edge reconstruction of locally finite disconnected graphs with a finite number of components
• Reconstruction of locally finite connected graphs with two infinite wings
• Non-reconstructible locally finite graphs
• Fixed finite subgraph theorems in infinite weakly modular graphs
• Reconstructing the number of blocks of an infinite graph
• On the reconstruction of rayless infinite forests
• scientific article; zbMATH DE number 6503891 (Why is no real title available?)
• Almost reconstructing infinite, rayless graphs
• Reconstruction of locally finite connected graphs with at least three infinite wings
• Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph
• scientific article; zbMATH DE number 883277 (Why is no real title available?)
• The reconstruction problem for certain infinite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406548)