Article ID Journal Published Year Pages File Type
9513249 Discrete Mathematics 2005 8 Pages PDF
Abstract
It is shown that two hypomorphic infinite graphs always have the same number of blocks. This settles a problem of Nash-Williams (C.St.J.A. Nash-Williams, Reconstruction of infinite graphs, Discrete Mathematics 95 (1991) 221-229).
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Reconstructing the number of blocks of an infinite graph
Authors
,