On the public citation graph
Graphs and degree sequences: Canonical decomposition
0 signed · 23 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/bfb0070380openalex-snapshot
Graphs and their degree sequences: A survey
inferredcites →https://doi.org/10.1016/0095-8956(72)90055-xopenalex-snapshot
On factorable degree sequences
inferredcites →https://doi.org/10.1090/s0002-9904-1960-10494-6openalex-snapshot
Matrices of zeros and ones
inferredcites →https://doi.org/10.1109/tcs.1976.1084170openalex-snapshot
Line removal algorithms for graphs and their degree lists
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_1openalex-snapshot
Relaxed and Approximate Graph Realizations
inferred← citeshttps://doi.org/10.1007/s00373-018-1953-1openalex-snapshot
Adjacency Relationships Forced by a Degree Sequence
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90023-2openalex-snapshot
Degree sequences of matrogenic graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90026-8openalex-snapshot
Once more on matrogenic graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90184-1openalex-snapshot
On forcibly hereditary p-graphical sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90152-6openalex-snapshot
Contributions to the theory of graphic sequences
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.050openalex-snapshot
Locating eigenvalues of matrogenic graphs in linear time
inferred← citeshttps://doi.org/10.1016/j.disc.2013.07.010openalex-snapshot
Hereditary unigraphs and Erdős–Gallai equalities
inferred← citeshttps://doi.org/10.1016/j.disc.2015.02.018openalex-snapshot
Minimal forbidden sets for degree sequence characterizations
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113483openalex-snapshot
Graph realizations: Maximum degree in vertex neighborhoods
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.012openalex-snapshot
On vertex-weighted realizations of acyclic and general graphs
inferred← citeshttps://doi.org/10.1080/16583655.2018.1474542openalex-snapshot
Narumi–Katayama index of the subdivision graphs
inferred← citeshttps://doi.org/10.1515/ausi-2015-0007openalex-snapshot
Recognition of split-graphic sequences
inferred← citeshttps://doi.org/10.21608/ejmaa.2019.312738openalex-snapshot
DEGREE SEQUENCES OF JOIN AND CORONA PRODUCTS OF GRAPHS VISHNU NARAYAN MISHRA1 , SADIK DELEN AND ISMAIL NACI CANGUL
inferred← citeshttps://doi.org/10.2478/amns.2020.2.00018openalex-snapshot
Degree Sequence of Graph Operator for some Standard Graphs
inferred← citeshttps://doi.org/10.28924/2291-8639-16-2018-809openalex-snapshot
Algebraic Structure of Graph Operations in Terms of Degree Sequences
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.