On the public citation graph
Simple and multigraphic realizations of degree sequences
0 signed · 22 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/bfb0088904openalex-snapshot
Pseudographic realizations of an infinitary degree sequence
inferredcites →https://doi.org/10.1007/bfb0102683openalex-snapshot
The graph of type (0, ∞, ∞) realizations of a graphic sequence
inferredcites →https://doi.org/10.1016/s0095-8956(76)80007-xopenalex-snapshot
Sequences with a unique realization by simple graphs
inferredcites →https://doi.org/10.1137/0110037openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
inferredcites →https://doi.org/10.1137/0111010openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
inferredcites →https://doi.org/10.21136/cpm.1955.108220openalex-snapshot
A remark on the existence of finite graphs
inferredcites →https://doi.org/10.2307/2372318openalex-snapshot
Partitions and Their Representative Graphs
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-1-4614-9161-3_4openalex-snapshot
Controlled Markovian Dynamics of Graphs: Unbiased Generation of Random Graphs with Prescribed Topological Properties
inferred← citeshttps://doi.org/10.1007/bfb0061978openalex-snapshot
The graph of hypergraphic realisations of denumerable multisets of degrees
inferred← citeshttps://doi.org/10.1007/s10955-009-9821-2openalex-snapshot
Constrained Markovian Dynamics of Random Graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112328openalex-snapshot
Making multigraphs simple by a sequence of double edge swaps
inferred← citeshttps://doi.org/10.1088/2632-072x/abf316openalex-snapshot
Transitions in random graphs of fixed degrees with many short cycles
inferred← citeshttps://doi.org/10.1093/comnet/cnw027openalex-snapshot
Switching edges to randomize networks: what goes wrong and how to fix it
inferred← citeshttps://doi.org/10.1137/16m1087175openalex-snapshot
Configuring Random Graph Models with Fixed Degree Sequences
inferred← citeshttps://doi.org/10.1145/3230743openalex-snapshot
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
inferred← citeshttps://doi.org/10.21248/gups.61035openalex-snapshot
Scalable generation of random graphs
inferred← citeshttps://doi.org/10.21248/gups.73935openalex-snapshot
Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory
inferred← citeshttps://doi.org/10.48550/arxiv.1704.01951openalex-snapshot
Swap connectivity for two graph spaces between simple and pseudo graphs and disconnectivity for triangle constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2008.11002openalex-snapshot
Transitions in loopy random graphs with fixed degrees and arbitrary degree distributions
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.