Ulam's Conjecture and Graph Reconstructions

DOI10.2307/2316851MaRDI QIDQ5581299zbMATH OpenOpenAlexWikidataFDO

Authors P. V. O'Neil

Publication date 1970

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2316851

zbMATH Keywords

topology

Cited in

(15)

• Relaxed and approximate graph realizations
• A graph polynomial and its applications
• On vertex-weighted realizations of acyclic and general graphs
• The polynomial reconstruction problem: the first 50 years
• Some Ulam's reconstruction problems for quantum states
• Local Pauli stabilizers of symmetric hypergraph states
• Reconstructing words from right-bounded-block words
• scientific article; zbMATH DE number 7651149 (Why is no real title available?)
• Seurat games on Stockmeyer graphs
• Graph realizations: maximum degree in vertex neighborhoods
• Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
• Reconstructing Words from Right-Bounded-Block Words
• Reconstruction of hypermatrices from subhypermatrices
• The complexity of homomorphism reconstructibility
• The complexity of homomorphism reconstructibility

This page was built for publication: Ulam's Conjecture and Graph Reconstructions

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