On the public citation graph
A survey of the reconstruction conjecture
0 signed · 84 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01299955openalex-snapshot
On the problem of reconstructing a tournament from subtournaments
inferredcites →https://doi.org/10.1007/bfb0059425openalex-snapshot
A graph with p points and enough distinct (p-2)-order subgraphs is reconstructible
inferredcites →https://doi.org/10.1007/bfb0066444openalex-snapshot
Reconstructing combinatorial geometries
inferredcites →https://doi.org/10.1016/0012-365x(72)90007-6openalex-snapshot
Reconstruction of maximal outerplanar graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90062-4openalex-snapshot
On reconstructing maximal outerplanar graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90064-8openalex-snapshot
Some basic observations on Kelly's conjecture for graphs
inferredcites →https://doi.org/10.1016/0095-8956(71)90024-4openalex-snapshot
On a conjecture concerning the reconstruction of graphs
inferredcites →https://doi.org/10.1016/0095-8956(72)90026-3openalex-snapshot
A simpler counterexample to the Reconstruction Conjecture for denumerable graphs
inferredcites →https://doi.org/10.1016/0095-8956(72)90068-8openalex-snapshot
A note on the line reconstruction problem
inferredcites →https://doi.org/10.1016/0095-8956(73)90028-2openalex-snapshot
Reconstructing the degree pair sequence of a digraph
inferredcites →https://doi.org/10.1016/0095-8956(74)90046-xopenalex-snapshot
Determining connectedness from subdigraphs
inferredcites →https://doi.org/10.1016/0095-8956(74)90066-5openalex-snapshot
The reconstruction of outerplanar graphs
inferredcites →https://doi.org/10.1016/0097-3165(71)90038-0openalex-snapshot
An investigation of Bhattacharya-type designs
inferredcites →https://doi.org/10.1016/s0021-9800(69)80063-3openalex-snapshot
A counterexample to the countable version of a conjecture of Ulam
inferredcites →https://doi.org/10.1016/s0021-9800(70)80088-6openalex-snapshot
On nonreconstructable tournaments
inferredcites →https://doi.org/10.1017/s0305004100044364openalex-snapshot
On Kelly's congruence theorem for trees
inferredcites →https://doi.org/10.1080/00029890.1970.11992413openalex-snapshot
Ulam's Conjecture and Graph Reconstructions
inferredcites →https://doi.org/10.1080/0025570x.1971.11976153openalex-snapshot
On Reconstruction of Matrices
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0232696-4openalex-snapshot
On Reconstructing a Graph
inferredcites →https://doi.org/10.1090/s0002-9939-1971-0286699-3openalex-snapshot
Reconstructing graphs
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb45118.xopenalex-snapshot
ON RECONSTRUCTING DISCONNECTED GRAPHS
inferredcites →https://doi.org/10.2140/pjm.1957.7.961openalex-snapshot
A congruence theorem for trees
inferredcites →https://doi.org/10.2140/pjm.1964.14.191openalex-snapshot
On some mappings related to graphs
inferredcites →https://doi.org/10.2140/pjm.1969.31.281openalex-snapshot
On Ulam’s conjecture for separable graphs
inferredcites →https://doi.org/10.2140/pjm.1974.52.331openalex-snapshot
Reconstructing infinite graphs
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2333777openalex-snapshot
The Theory of Graphs and its Applications.
inferredcites →https://doi.org/10.4153/cjm-1966-079-8openalex-snapshot
The Reconstruction of a Tree from its Maximal Subtrees
inferredcites →https://doi.org/10.4153/cmb-1974-106-9openalex-snapshot
Unicyclic Graphs Satisfy Harary′s Conjecture
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190010309openalex-snapshot
Computer reconstruction of small graphs
inferred← citeshttps://doi.org/10.1002/rsa.20899openalex-snapshot
Shotgun assembly of random jigsaw puzzles
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_6openalex-snapshot
Randomized Algorithms and Complexity Classes
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_76openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_24openalex-snapshot
Easily checked self-reducibility
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_22openalex-snapshot
Realization Problems on Reachability Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_2openalex-snapshot
Reconstructing Graphs from Connected Triples
inferred← citeshttps://doi.org/10.1007/978-3-319-11478-1_5openalex-snapshot
Ordered Sets, Induction, and the Axiom of Choice
inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_13openalex-snapshot
Reconstructing Cactus Graphs from Shortest Path Information
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_10openalex-snapshot
Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_12openalex-snapshot
Reconstruction of Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_12openalex-snapshot
Reconstruction Algorithm for Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_29openalex-snapshot
Bipartite Permutation Graphs Are Reconstructible
inferred← citeshttps://doi.org/10.1007/978-3-642-27317-9_3openalex-snapshot
The Reconstruction Conjecture
inferred← citeshttps://doi.org/10.1007/bf01108765openalex-snapshot
Towards the reconstruction of posets
inferred← citeshttps://doi.org/10.1007/bf01578845openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/s00373-013-1360-6openalex-snapshot
Indistinguishable Trees and Graphs
inferred← citeshttps://doi.org/10.1007/s12190-024-02152-xopenalex-snapshot
Reconstruction of old maps based on old photos using fuzzy graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90111-xopenalex-snapshot
Counterexamples to the edge reconstruction conjecture for infinite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.04.029openalex-snapshot
What is reconstruction for ordered sets?
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113986openalex-snapshot
On the computation of Seidel Laplacian eigenvalues for graph-based binary codes
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115058openalex-snapshot
Graph reconstruction from connected triples
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104076openalex-snapshot
Decks of rooted binary trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.006openalex-snapshot
Reconstruction of interval graphs
inferred← citeshttps://doi.org/10.1080/16073606.1984.9632328openalex-snapshot
ON α,β DESTRUCTIBLE GRAPHS
inferred← citeshttps://doi.org/10.1109/tnse.2017.2776913openalex-snapshot
Shotgun Assembly of Labeled Graphs
inferred← citeshttps://doi.org/10.1137/23m1615784openalex-snapshot
An Algorithm to Recover Shredded Random Matrices
inferred← citeshttps://doi.org/10.1137/s0097539792234901openalex-snapshot
Easily Checked Generalized Self-Reducibility
inferred← citeshttps://doi.org/10.1142/s1793830912500395openalex-snapshot
BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
inferred← citeshttps://doi.org/10.1155/s016117128700019xopenalex-snapshot
On the reconstraction of the matching polynomial and the reconstruction conjecture
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.426openalex-snapshot
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.37236/2863openalex-snapshot
Totally Symmetric Functions are Reconstructible from Identification Minors
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.10openalex-snapshot
Minimum Neighboring Degree Realization in Graphs and Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1875openalex-snapshot
Reconstruction Conjecture for Graphs Isomorphic to Cube of a Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1510.00958openalex-snapshot
Existence of k-ary Trees: Subtree Sizes, Heights and Depths
inferred← citeshttps://doi.org/10.48550/arxiv.1512.08473openalex-snapshot
Shotgun assembly of random regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1712.10322openalex-snapshot
Proof of Kelly-Ulam Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1911.05256openalex-snapshot
A Hierarchy of Graph Neural Networks Based on Learnable Local Features
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.