On the public citation graph
Reconstructing graphs
0 signed · 26 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.1017/s0305004100044364openalex-snapshot
On Kelly's congruence theorem for trees
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0232696-4openalex-snapshot
On Reconstructing a Graph
inferredcites →https://doi.org/10.2140/pjm.1957.7.961openalex-snapshot
A congruence theorem for trees
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.4153/cjm-1966-079-8openalex-snapshot
The Reconstruction of a Tree from its Maximal Subtrees
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.22454openalex-snapshot
The edge‐subgraph poset of a graph and the edge reconstruction conjecture
inferred← citeshttps://doi.org/10.1002/jgt.3190190409openalex-snapshot
Some results on the reconstruction problems. p‐claw‐free, chordal, and p4‐reducible graphs
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_76openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_3openalex-snapshot
The Tutte Polynomial Part I: General Theory
inferred← citeshttps://doi.org/10.1007/bf01578845openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/bfb0066431openalex-snapshot
A survey of the reconstruction conjecture
inferred← citeshttps://doi.org/10.1007/bfb0066444openalex-snapshot
Reconstructing combinatorial geometries
inferred← citeshttps://doi.org/10.1007/bfb0092285openalex-snapshot
Nearly line regular graphs and their reconstruction
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90003-9openalex-snapshot
The reconstruction of separable graphs with 2-connected trunks that are series-parallel networks
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00183-3openalex-snapshot
Edge-recognizable domination numbers
inferred← citeshttps://doi.org/10.1017/s0004972700023613openalex-snapshot
A note on the edge reconstruction conjecture
inferred← citeshttps://doi.org/10.1017/s000497270004065xopenalex-snapshot
On the edge-reconstruction of graphs
inferred← citeshttps://doi.org/10.1017/s1446788700017201openalex-snapshot
On the reconstruction conjecture for separable graphs
inferred← citeshttps://doi.org/10.1023/a:1005942604911openalex-snapshot
Reconstructibility of Graphs with a Large Branch: Permutation Group Theory and Graph Reconstruction
inferred← citeshttps://doi.org/10.1080/16073606.1984.9632328openalex-snapshot
ON α,β DESTRUCTIBLE GRAPHS
inferred← citeshttps://doi.org/10.1090/s0002-9939-1971-0286699-3openalex-snapshot
Reconstructing graphs
inferred← citeshttps://doi.org/10.1111/j.2164-0947.1970.tb02070.xopenalex-snapshot
S ection of M athematics : STATISTICAL INFERENCE IN FINITE POPULATIONS HAVING STRUCTURE*
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.