✦ LIBER ✦

Reconstructing the number of blocks of an infinite graph

✍ Scribed by Thomas Andreae

Book ID: 108113539
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 176 KB
Volume: 297
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.02.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 _

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

Reconstruction of infinite graphs

✍ C.St.J.A. Nash-Williams 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 929 KB

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

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[?

The Ulam number of infinite graphs

✍ Kiran B. Chilakamarri; Nathaniel Dean 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 811 KB

On the Hadwiger number of infinite graph

On the Hadwiger number of infinite graphs

✍ N. Seifter 📂 Article 📅 1992 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 501 KB