On reconstructing graphs from their sets of subgraphs

DOI10.1016/0095-8956(76)90056-3MaRDI QIDQ1229231zbMATH OpenOpenAlexFDO

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

Cites work

• A congruence theorem for trees
• A note on the line reconstruction problem
• A technique for reconstructing disconnected graphs
• scientific article; zbMATH DE number 3227794 (Why is no real title available?)
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)
• scientific article; zbMATH DE number 3299378 (Why is no real title available?)
• On a conjecture concerning the reconstruction of graphs
• On Reconstructing a Graph
• ON RECONSTRUCTING DISCONNECTED GRAPHS
• On reconstruction of graphs
• On the problem of reconstructing a tournament from subtournaments
• On Ulam's conjecture for separable graphs
• Reconstructing Graphs
• Reconstruction of maximal outerplanar graphs
• Reconstruction of Trees
• Unicyclic Graphs Satisfy Harary′s Conjecture

Cited in

(5)

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

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

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