On the public citation graph
Valencies of graphs with 1-factors
0 signed · 31 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.1016/0095-8956(72)90055-xopenalex-snapshot
On factorable degree sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_26openalex-snapshot
An Improved Algorithm for Finding Cycles Through Elements
inferred← citeshttps://doi.org/10.1007/978-3-540-93952-8openalex-snapshot
Graph Factors and Matching Extensions
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_4openalex-snapshot
Small Cycle Double Covers of Graphs
inferred← citeshttps://doi.org/10.1007/bfb0070380openalex-snapshot
Graphs and their degree sequences: A survey
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.1007/s00373-011-1044-zopenalex-snapshot
Degree Sequences and the Existence of k-Factors
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90068-xopenalex-snapshot
The k-factor conjecture is true
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90070-2openalex-snapshot
A short proof of kundu's k-factor theorem
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0116-lopenalex-snapshot
On asymmetric (0, 1)-matrices with given row and column sum vectors
inferred← citeshttps://doi.org/10.1016/0016-0032(80)90013-7openalex-snapshot
Subgraphs and Their Degree Sequences of a Digraph
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90228-1openalex-snapshot
On Ryser's maximum term rank formula
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90285-5openalex-snapshot
The structure matrix and a generalization of Ryser's maximum term rank formula
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90430-vopenalex-snapshot
The structure matrix of the class of r-multigraphs with a prescribed degree sequence
inferred← citeshttps://doi.org/10.1016/j.dam.2010.09.011openalex-snapshot
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.019openalex-snapshot
On the bipartite graph packing problem
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.034openalex-snapshot
Navigating between packings of graphic sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.059openalex-snapshot
Graph factors and factorization: 1985–2003: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2015.07.017openalex-snapshot
A note on packing of graphic n -tuples
inferred← citeshttps://doi.org/10.1080/03081088908817902openalex-snapshot
The class of 2-multigraphs with a prescribed degree sequence
inferred← citeshttps://doi.org/10.1137/100799733openalex-snapshot
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
inferred← citeshttps://doi.org/10.1137/140987912openalex-snapshot
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
inferred← citeshttps://doi.org/10.3390/math12223518openalex-snapshot
New Results on Graph Matching from Degree-Preserving Growth
inferred← citeshttps://doi.org/10.4153/cmb-1980-003-5openalex-snapshot
A Note on Degree Sequences of Graphs
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-048openalex-snapshot
Cycles through two edges in signed graphs
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.