On Reconstructing a Graph

DOI10.2307/2035985MaRDI QIDQ5549651zbMATH OpenOpenAlexFDO

Authors R. L. Hemminger

Publication date 1969

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

zbMATH Keywords

topology

Cites work

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

Cited in

(9)

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

This page was built for publication: On Reconstructing a Graph

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