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

DOI10.1002/JGT.3190180202MaRDI QIDQ4284097zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Reconstructing the number of blocks of an infinite graph
• The reconstruction problem for certain infinite graphs
• Computing the number of induced copies of a fixed graph in a bounded degree graph
• Reconstruction of infinite locally finite connected graphs
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Reconstruction of infinite graphs
• Finite-type invariants for graphs and graph reconstructions
• On a property of graphs containing infinitely many isomorphic copies of themselves
• On the maximum number of copies of H in graphs with given size and order
• On the reconstruction of graph invariants

Cites work

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

Cited in

(1)

• Reconstructing the number of blocks of an infinite graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284097)