On a conjecture concerning the reconstruction of graphs

DOI10.1016/0095-8956(71)90024-4zbMath0196.27402OpenAlexW2041475028MaRDI QIDQ2539550

Roger M. Bryant

Publication date: 1971

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(71)90024-4

zbMATH Keywords

topology

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Complexity results in graph reconstruction ⋮ On reconstructing graphs from their sets of subgraphs ⋮ Graph reconstruction—a survey

Cites Work

• Unnamed Item
• On Ulam's conjecture for separable graphs
• Section graphs for finite permutation groups

This page was built for publication: On a conjecture concerning the reconstruction of graphs