Ulam's Conjecture and Graph Reconstructions
From MaRDI portal
Publication:5581299
DOI10.2307/2316851zbMath0187.45602OpenAlexW4254787765WikidataQ56211091 ScholiaQ56211091MaRDI QIDQ5581299
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
Related Items
Reconstructing Words from Right-Bounded-Block Words ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ Seurat games on Stockmeyer graphs ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ Unnamed Item ⋮ The polynomial reconstruction problem: the first 50 years ⋮ Local Pauli stabilizers of symmetric hypergraph states ⋮ A graph polynomial and its applications ⋮ Some Ulam’s reconstruction problems for quantum states ⋮ Reconstructing Words from Right-Bounded-Block Words ⋮ Relaxed and approximate graph realizations