On the public citation graph

Computer representation of generic chemical structures by an extended block-cutpoint tree

https://doi.org/10.1021/ci00038a007
0 signed · 13 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcms.36openalex-snapshot
Representation of chemical structures
inferred← citeshttps://doi.org/10.1007/978-3-642-73975-0_12openalex-snapshot
Problems of Substructure Search and Their Solution
inferred← citeshttps://doi.org/10.1016/b978-0-444-89217-1.50011-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.amc.2019.04.037openalex-snapshot
Multi-distance granularity structural α-subtree index of generalized Bethe trees
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128334openalex-snapshot
Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.09.025openalex-snapshot
On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.043openalex-snapshot
Constant time enumeration of weighted trees
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104942openalex-snapshot
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.028openalex-snapshot
Enumeration of BC-subtrees of trees
inferred← citeshttps://doi.org/10.1080/00207160.2016.1148811openalex-snapshot
On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
inferred← citeshttps://doi.org/10.3390/math7050472openalex-snapshot
On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution
inferred← citeshttps://doi.org/10.3390/math9010036openalex-snapshot
On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4711openalex-snapshot
On BC-trees and BC-subtrees
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.