Reconstructing the degree sequence and the number of components of an infinite graph

DOI10.1016/0012-365X(82)90035-8zbMath0449.05051MaRDI QIDQ1147163

Thomas Andreae

Publication date: 1982

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

zbMATH Keywords

reconstruction conjecturedegree sequence

Mathematics Subject Classification ID

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

Related Items (6)

Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph ⋮ Reconstruction of infinite locally finite connected graphs ⋮ Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs ⋮ Reconstruction of locally finite connected graphs with two infinite wings ⋮ Reconstruction of infinite graphs ⋮ Reconstructing the number of blocks of an infinite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing infinite graphs
• A simpler counterexample to the reconstruction conjecture for denumerable graphs
• Graph reconstruction—a survey

This page was built for publication: Reconstructing the degree sequence and the number of components of an infinite graph