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

DOI10.1002/JGT.3190180202zbMath0795.05100OpenAlexW2039280363MaRDI QIDQ4284097

Andrew J. H. King, C. St. J. A. Nash-Williams

Publication date: 11 September 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180202

zbMATH Keywords

reconstructioninfinite graphshypomorphism

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Reconstructing the number of blocks of an infinite graph

Cites Work

• Reconstructing the degree sequence and the number of components of an infinite graph
• Reconstruction of infinite graphs

This page was built for publication: Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph