On the public citation graph
Contrained switchings in graphs
0 signed · 35 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.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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119970606.ch15openalex-snapshot
Modelling Biological Networks via Tailored Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_18openalex-snapshot
Reconfiguration of Graphs with Connectivity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_7openalex-snapshot
Approximating Shortest Connected Graph Transformation for Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-60754-8_15openalex-snapshot
Empirical Spectral Distributions of Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_22openalex-snapshot
A Triangle Process on Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70666-3_16openalex-snapshot
The Decycling Number of Cubic Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24983-9_2openalex-snapshot
Regular Graphs with Maximum Forest Number
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.1017/s0963548317000499openalex-snapshot
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
inferred← citeshttps://doi.org/10.1038/s41467-024-48617-2openalex-snapshot
A theory of evolutionary dynamics on any complex population structure reveals stem cell niche architecture as a spatial suppressor of selection
inferred← citeshttps://doi.org/10.1038/s41598-021-92519-yopenalex-snapshot
Configuration models as an urn problem
inferred← citeshttps://doi.org/10.1080/15427951.2016.1164768openalex-snapshot
Fast Sequential Creation of Random Realizations of Degree Sequences
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.1101/2021.02.07.430151openalex-snapshot
A theory of evolutionary dynamics on any complex spatial structure
inferred← citeshttps://doi.org/10.1137/0603011openalex-snapshot
Switchings Constrained to 2-Connectivity in Simple Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611972795.83openalex-snapshot
Graph Generation with Prescribed Feature Constraints
inferred← citeshttps://doi.org/10.1137/16m1087175openalex-snapshot
Configuring Random Graph Models with Fixed Degree Sequences
inferred← citeshttps://doi.org/10.1145/2187836.2187951openalex-snapshot
Understanding task-driven information flow in collaborative networks
inferred← citeshttps://doi.org/10.1186/1471-2105-15-220openalex-snapshot
Exploring community structure in biological networks with random graphs
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1011905openalex-snapshot
Evolutionary graph theory beyond pairwise interactions: Higher-order network motifs shape times to fixation in structured populations
inferred← citeshttps://doi.org/10.14778/3632093.3632118openalex-snapshot
MOSER: Scalable Network Motif Discovery Using Serial Test
inferred← citeshttps://doi.org/10.1561/9781601988133openalex-snapshot
Interactive Sensing and Decision Making in Social Networks
inferred← citeshttps://doi.org/10.21203/rs.3.rs-254843/v1openalex-snapshot
Configuration Models as an Urn Problem: The Generalized Hypergeometric Ensemble of Random Graphs
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.1809.05443openalex-snapshot
Reconfiguration of graphs with connectivity constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1810.06495openalex-snapshot
Generalised hypergeometric ensembles of random graphs: the configuration model as an urn problem
inferred← citeshttps://doi.org/10.70675/1d366b25z29b0z4b44zaef4z87e889a6ee49openalex-snapshot
Graph domination and reconfiguration problems
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.