On the public citation graph

Characterizations of 2-dimensional trees

0 signed · 12 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0021-9800(69)80120-1openalex-snapshot
The number of labeled k-dimensional trees
inferredcites →https://doi.org/10.1112/s002557930000245xopenalex-snapshot
On acyclic simplicial complexes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf02330563openalex-snapshot
The number of labeled dissections of ak-ball
inferred← citeshttps://doi.org/10.1007/bf02485713openalex-snapshot
On some strongly rigid families of graphs and the full embeddings they induce
inferred← citeshttps://doi.org/10.1007/bfb0070359openalex-snapshot
Theory and Applications of Graphs
inferred← citeshttps://doi.org/10.1007/s00493-023-00080-1openalex-snapshot
Euler’s Theorem for Regular CW-Complexes
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90083-5openalex-snapshot
Higher-dimensional tree structures
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00180-8openalex-snapshot
Multidimensional bipartite trees
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00073-9openalex-snapshot
On some relations between 2-trees and tree metrics
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80149-0openalex-snapshot
Generalized trees related with tree metrics
inferred← citeshttps://doi.org/10.1142/s0218216523500190openalex-snapshot
Canonical sphere bases for simplicial and cubical complexes
inferred← citeshttps://doi.org/10.20429/tag.2024.000105openalex-snapshot
A Survey of Maximal k-Degenerate Graphs and k-Trees
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.