On reconstruction of graphs

DOI10.1007/BFb0060119zbMath0185.27703OpenAlexW120010608MaRDI QIDQ5577688

Bennet Manvel

Publication date: 1969

Published in: The Many Facets of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0060119

zbMATH Keywords

Ulam's conjecture

Mathematics Subject Classification ID

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

Related Items (11)

Fractional isomorphism of graphs ⋮ 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs ⋮ Reconstructing degree sequences from k-vertex-deleted subgraphs ⋮ The adversary degree-associated reconstruction number of double-brooms ⋮ Weighted graphs and university course timetabling ⋮ The degree sequence is reconstructible from \(n-1\) cards ⋮ Reconstruction of small graphs and digraphs ⋮ Rélations non reconstructibles par leurs restrictions ⋮ On reconstructing graphs from their sets of subgraphs ⋮ Reconstruction of maximal outerplanar graphs ⋮ Reconstructing the degree pair sequence of a digraph

This page was built for publication: On reconstruction of graphs