✦ LIBER ✦

Reconstruction of infinite graphs

✍ Scribed by C.St.J.A. Nash-Williams

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 929 KB
Volume: 95
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90338-3

No coin nor oath required. For personal study only.

✦ Synopsis

The paper recalls several known results concerning reconstruction and edge-reconstruction of infinite graphs, and draws attention to some possibly interesting unsolved problems.

📜 SIMILAR VOLUMES

Reconstructibility versus edge reconstru

Reconstructibility versus edge reconstructibility of infinite graphs

✍ Carsten Thomassen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 151 KB

## RECONgTRUCTIBILITY VERSUI~ EDGE RECONSTR1UCTIBILtlY OF !NF![?CTE GN~APNS Cars,~en -FI-!Ob,~ ASSEN A.hah,,\*~atL~k /~.t;tir~\*., t h~ieersi;e~sp ~tk~'n, S0{P} Aarbus C. Detm~a& Rcc~ .d 23 [;cccm~cr 1~)77 [~¢ :{>.cd 7 April D)TS For every cm~dma! a >R o ~here exi::ts an ,:t-rQ,',ular .g;api~ w[?

Almost reconstructing infinite, rayless

Almost reconstructing infinite, rayless graphs

✍ Rüdiger Schmidt 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

We show that for every infinite, rayless graph G the following holds. If G is hypomorphic to H then G is isomorphic to an induced subgraph of H and H is isomorphic to an induced subgraph of G. This proves a conjecture of R. Halin for the class of infinite, rayless graphs and partly extends a result

Counterexamples to the edge reconstructi

Counterexamples to the edge reconstruction conjecture for infinite graphs

✍ Carsten Thomassen 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 407 KB

VWtWiCS cd ~~~tl~Jk:lJtJO?I. &JCJdty of .%iiJthYmcJtics. ~hatwrsrty of W&ur

Reconstructing the number of copies of a

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph

✍ A. J. H. King; C. St. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _

Reconstruction of locally finite connect

Reconstruction of locally finite connected graphs with at least three infinite wings

✍ C. St. J. A. Nash-Williams 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB 👁 1 views

Reconstructing the degree sequence and t

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

✍ Thomas Andreae 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 812 KB

We prove that the degree sequence of an infinite graph is reconstructibjle from its family of vertex-deleted subgraphs. Furthermore, as another result concerning the reconstruction of infinite graphs, we prove that the number c(G) of components of an infinite graph G is re~ons~uct~b~e if there is at