✦ LIBER ✦

On the edge reconstruction of locally finite disconnected graphs with a finite number of components

✍ Scribed by Thomas Andreae

Book ID: 112946581
Publisher: Vandenhoeck & Ruprecht
Year: 1985
Tongue: German
Weight: 582 KB
Volume: 55
Category: Article
ISSN: 0025-5858
DOI: 10.1007/bf02941501

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge reconstruction number of a disc

The edge reconstruction number of a disconnected graph

✍ Robert Molina 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

Note on the reconstruction of infinite g

Note on the reconstruction of infinite graphs with a fixed finite number of components

✍ Thomas Andreae 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G

On the number of 1-factors of locally fi

On the number of 1-factors of locally finite graphs

✍ François Bry 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 477 KB

On the hamiltonicity of line graphs of l

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

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 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 _