On the public citation graph
Graph factors
0 signed · 76 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/0012-365x(74)90075-2openalex-snapshot
Spanning subgraphs with specified valencies
inferredcites →https://doi.org/10.1016/0012-365x(78)90006-7openalex-snapshot
An extension of Tutte's 1-factor theorem
inferredcites →https://doi.org/10.1016/s0021-9800(70)80033-3openalex-snapshot
Subgraphs with prescribed valencies
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.4153/cjm-1954-033-3openalex-snapshot
A Short Proof of the Factor Theorem for Finite Graphs
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.20008openalex-snapshot
Stability number and [a,b]‐factors in graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1002/jgt.3190090110openalex-snapshot
Almost‐regular factorization of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090111openalex-snapshot
[a,b]‐factorization of a graph
inferred← citeshttps://doi.org/10.1002/jgt.3190150304openalex-snapshot
Regular factors in K1,3‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190150306openalex-snapshot
[a,b]‐factorizations of graphs
inferred← citeshttps://doi.org/10.1006/jctb.1997.1797openalex-snapshot
A Characterization of Graphs Having All (g, f)-Factors
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_7openalex-snapshot
On a Min-max Theorem of Cacti
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_1openalex-snapshot
Relaxed and Approximate Graph Realizations
inferred← citeshttps://doi.org/10.1007/978-3-540-93952-8openalex-snapshot
Graph Factors and Matching Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_23openalex-snapshot
Dag Realizations of Directed Degree Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/bf01137412openalex-snapshot
Three-regular parts of four-regular graphs
inferred← citeshttps://doi.org/10.1007/bf01152554openalex-snapshot
Regular subpseudographs of regular pseudographs
inferred← citeshttps://doi.org/10.1007/bf01787576openalex-snapshot
A sufficient condition for a graph to have [a, b]-factors
inferred← citeshttps://doi.org/10.1007/bf02880002openalex-snapshot
A [k,k+1]-factor containing given Hamiltonian cycle
inferred← citeshttps://doi.org/10.1007/bfb0073114openalex-snapshot
Graph factors with given properties
inferred← citeshttps://doi.org/10.1007/s00373-004-0587-7openalex-snapshot
Connected Factors in Graphs ? a Survey
inferred← citeshttps://doi.org/10.1007/s00373-012-1168-9openalex-snapshot
Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph
inferred← citeshttps://doi.org/10.1007/s00373-012-1250-3openalex-snapshot
Stability Number and f-Factors in Graphs
inferred← citeshttps://doi.org/10.1007/s10100-013-0309-4openalex-snapshot
Gallai-Edmonds decomposition as a pruning technique
inferred← citeshttps://doi.org/10.1007/s10479-014-1582-xopenalex-snapshot
Weighted matching as a generic pruning technique applied to optimization constraints
inferred← citeshttps://doi.org/10.1007/s40314-025-03419-0openalex-snapshot
Spectral extremal problem on all (a, b, k)-critical graphs
inferred← citeshttps://doi.org/10.1007/s40314-026-03718-0openalex-snapshot
Spectral radius and critical covered graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90077-8openalex-snapshot
[a, b]-factors of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90116-yopenalex-snapshot
Sufficient conditions for a graph to have factors
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90387-wopenalex-snapshot
A simple existence criterion for (g < f)- factors
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90378-fopenalex-snapshot
On some factor theorems of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00157-ropenalex-snapshot
On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00328-topenalex-snapshot
Connected [k, k + 1]-factors of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90025-0openalex-snapshot
Factors of regular graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90126-wopenalex-snapshot
Simplified existence theorems for (g,f)-factors
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90129-zopenalex-snapshot
The complexity of regular subgraph recognition
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90022-7openalex-snapshot
An algorithmic proof of Tutte's f-factor theorem
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.016openalex-snapshot
Cycles in complementary prisms
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.2008.05.005openalex-snapshot
Linear-time certifying algorithms for near-graphical sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2008.07.026openalex-snapshot
Hamilton decompositions of graphs with primitive complements
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.006openalex-snapshot
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
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.disc.2024.113975openalex-snapshot
Spectral conditions for graphs having all (fractional) [a,b]-factors
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.02.001openalex-snapshot
Editing graphs to satisfy degree constraints: A parameterized approach
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00045-xopenalex-snapshot
On the graphic matroid parity problem
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70840-9openalex-snapshot
Les Facteurs Des Graphes
inferred← citeshttps://doi.org/10.1137/110850402openalex-snapshot
Factors with Multiple Degree Constraints in Graphs
inferred← citeshttps://doi.org/10.1137/20m1326489openalex-snapshot
Efficiently Realizing Interval Sequences
inferred← citeshttps://doi.org/10.1145/195613.195663openalex-snapshot
Average-case analysis of algorithms for matchings and related problems
inferred← citeshttps://doi.org/10.3390/math12223518openalex-snapshot
New Results on Graph Matching from Degree-Preserving Growth
inferred← citeshttps://doi.org/10.37236/3594openalex-snapshot
Extensions to 2-Factors in Bipartite Graphs
inferred← citeshttps://doi.org/10.4171/ggd/730openalex-snapshot
Property (T) in density-type models of random groups
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.47openalex-snapshot
Efficiently Realizing Interval Sequences
inferred← citeshttps://doi.org/10.7151/dmgt.1964openalex-snapshot
A degree condition implying Ore-type condition for even [2,b]-factors in graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00429openalex-snapshot
A Note on the Existence of All (g,f)-Factors
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.