On reconstructing graphs from their sets of subgraphs

DOI10.1016/0095-8956(76)90056-3zbMATH Open0335.05129OpenAlexW2052603867MaRDI QIDQ1229231FDOQ1229231

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

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

Cited In (5)

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

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)