The reconstruction problem for certain infinite graphs

DOI10.1007/BF02579145zbMATH Open0559.05042OpenAlexW2075201307MaRDI QIDQ802575FDOQ802575

Authors: Michael von Rimscha 

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579145

Recommendations

• Reconstruction of infinite locally finite connected graphs
• Reconstruction of locally finite connected graphs with two infinite wings
• Reconstruction of locally finite connected graphs with at least three infinite wings
• scientific article; zbMATH DE number 883277
• On the edge reconstruction of locally finite disconnected graphs with a finite number of components

zbMATH Keywords

infinite graphsreconstructibility

Mathematics Subject Classification ID

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

Cites Work

• Reconstructibility and perfect graphs
• Fastplättbare Graphen
• Reconstructing infinite graphs
• Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees)

Cited In (8)

• Title not available (Why is that?)
• On the reconstruction of rayless infinite forests
• Reconstruction of infinite matroids from their 3-connected minors
• Non-reconstructible locally finite graphs
• Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph
• Reconstruction of locally finite connected graphs with at least three infinite wings
• Reconstruction of locally finite connected graphs with two infinite wings
• Reconstruction of infinite locally finite connected graphs

This page was built for publication: The reconstruction problem for certain infinite graphs

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