On Reconstructing a Graph

DOI10.2307/2035985zbMath0164.54104OpenAlexW4246957823MaRDI QIDQ5549651

R. L. Hemminger

Publication date: 1969

Full work available at URL: https://doi.org/10.2307/2035985

zbMATH Keywords

topology

Related Items

On the Hopf algebra of multi-complexes, Complexity results in graph reconstruction, Reconstructing Graphs, Reconstructing Graphs, A note on uniquely reducible graphs, On reconstructing graphs from their sets of subgraphs, Graph theory (algorithmic, algebraic, and metric problems), Reconstruction of maximal outerplanar graphs, Reconstructing the degree pair sequence of a digraph

Cites Work

• A congruence theorem for trees
• Congruent Graphs and the Connectivity of Graphs
• The Reconstruction of a Tree from its Maximal Subtrees