Reconstructing the number of blocks of an infinite graph
From MaRDI portal
Publication:2566150
DOI10.1016/j.disc.2005.02.015zbMath1070.05062MaRDI QIDQ2566150
Publication date: 22 September 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.02.015
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing the degree sequence and the number of components of an infinite graph
- Reconstruction of infinite graphs
- Reconstructing infinite graphs
- On reconstructing rooted trees
- Reconstruction of infinite locally finite connected graphs
- On Ulam's conjecture for separable graphs
- A simpler counterexample to the reconstruction conjecture for denumerable graphs
- A Glance at Graph Theory-Part II
- Graph reconstruction—a survey
- Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph
- Infinite digraphs with nonreconstructible outvalency sequences