On the public citation graph
Graph property recognition machines
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.1073/pnas.40.10.1004openalex-snapshot
A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
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.3190030206openalex-snapshot
Spanning arborescences, ingraphs, and outgraphs
inferred← citeshttps://doi.org/10.1007/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferred← citeshttps://doi.org/10.1007/s00454-018-0041-xopenalex-snapshot
Enumerative Combinatorics of Simplicial and Cell Complexes: Kirchhoff and Trent Type Theorems
inferred← citeshttps://doi.org/10.1016/0020-0255(76)90021-9openalex-snapshot
Toward a mathematical theory of graph-generative systems and its applications
inferred← citeshttps://doi.org/10.1016/0020-0255(80)90024-9openalex-snapshot
Sequential and cellular graph automata
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90046-3openalex-snapshot
Balanced vertex weightings and arborescences
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90288-2openalex-snapshot
Cellular graph automata. I. basic concepts, graph property measurement, closure properties
inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80049-2openalex-snapshot
Web grammars and several graphs
inferred← citeshttps://doi.org/10.1016/s0146-664x(72)80020-0openalex-snapshot
On the recognition of topological invariants by 4-way finite automata
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80003-7openalex-snapshot
A Generalization to Bases Common to r Binary Matroids A the Weighted Matrix-Tree Theorem in the Case when the Weights are Boolean
inferred← citeshttps://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferred← citeshttps://doi.org/10.1109/swat.1972.15openalex-snapshot
On the relation of graph grammars and graph automata
inferred← citeshttps://doi.org/10.1137/0130017openalex-snapshot
Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
inferred← citeshttps://doi.org/10.1145/356616.356617openalex-snapshot
Progress in Picture Processing: 1969--71
inferred← citeshttps://doi.org/10.1145/62546.62568openalex-snapshot
Computing on an anonymous network
inferred← citeshttps://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800222.806746openalex-snapshot
Election and traversal in unidirectional networks
inferred← citeshttps://doi.org/10.61841/turcomat.v10i3.14357openalex-snapshot
A Study of Chemical Compound of Graph with help of Computer Coding
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.