On the public citation graph

Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops

https://doi.org/10.1137/0118005
0 signed · 14 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.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/0115036openalex-snapshot
On Determining Minimal Singularities for the Realizations of an Incidence Sequence
inferredcites →https://doi.org/10.1137/0118019openalex-snapshot
On Determining the Minimum Number of Multiple Edges for an Incidence Sequence

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230030303openalex-snapshot
On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
inferred← citeshttps://doi.org/10.1002/sapm197655187openalex-snapshot
Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_1openalex-snapshot
Relaxed and Approximate Graph Realizations
inferred← citeshttps://doi.org/10.1007/bf01584076openalex-snapshot
Some problems in discrete optimization
inferred← citeshttps://doi.org/10.1007/bfb0092288openalex-snapshot
A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90037-xopenalex-snapshot
Algorithms for constructing graphs and digraphs with given valences and factors
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2362-4.50012-0openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.orl.2008.05.004openalex-snapshot
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115574openalex-snapshot
On the role of the equal partition in degree realization by a bipartite graph
inferred← citeshttps://doi.org/10.1137/23m1547585openalex-snapshot
On Bipartite Graph Realizations of a Single Degree Sequence
inferred← citeshttps://doi.org/10.1137/s0895480103432477openalex-snapshot
Parsimonious Multigraphs
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.