On reconstructing graphs from their sets of subgraphs

DOI10.1016/0095-8956(76)90056-3zbMath0335.05129OpenAlexW2052603867MaRDI QIDQ1229231

Bennet Manvel

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90056-3

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (5)

Set recognition of decomposable graphs and steps towards their reconstruction ⋮ Edge-recognizable domination numbers. ⋮ Reconstruction of small graphs and digraphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Realization problems on reachability sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• On the problem of reconstructing a tournament from subtournaments
• On Ulam's conjecture for separable graphs
• On a conjecture concerning the reconstruction of graphs
• Reconstruction of maximal outerplanar graphs
• A note on the line reconstruction problem
• Unicyclic Graphs Satisfy Harary′s Conjecture
• On Reconstructing a Graph
• On reconstruction of graphs
• Reconstruction of Trees
• Reconstructing Graphs
• A technique for reconstructing disconnected graphs
• ON RECONSTRUCTING DISCONNECTED GRAPHS

This page was built for publication: On reconstructing graphs from their sets of subgraphs