Reconstructing infinite graphs

DOI10.2140/PJM.1974.52.331MaRDI QIDQ1212949zbMATH OpenOpenAlexFDO

Authors J. A. Bondy, R. L. Hemminger

Publication date 1974

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/pjm.1974.52.331

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(13)

• On the edge reconstruction of locally finite disconnected graphs with a finite number of components
• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstruction of locally finite connected graphs with two infinite wings
• Reconstruction of infinite graphs
• Reconstruction of infinite locally finite connected graphs
• Non-reconstructible locally finite graphs
• Reconstructing the number of blocks of an infinite graph
• Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
• Reconstruction of locally finite connected graphs with at least three infinite wings
• On the reconstruction of locally finite trees
• Graph reconstruction—a survey
• Reconstruction from smaller cards
• The reconstruction problem for certain infinite graphs

This page was built for publication: Reconstructing infinite graphs

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