On the public citation graph
On factorisation of graphs
0 signed · 66 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/bf01206601openalex-snapshot
Über mehrdeutige Abbildungen von Mengen
inferredcites →https://doi.org/10.1007/bf01214296openalex-snapshot
�ber die Zerlegung regul�rer Streckenkomplexe ungerader Ordnung
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1093/qmath/os-20.1.95openalex-snapshot
FACTORIZATION OF EVEN GRAPHS
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-1950-005-2openalex-snapshot
The Factorization of Locally 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.20581openalex-snapshot
Regular Graphs, Eigenvalues and Regular Factors
inferred← citeshttps://doi.org/10.1002/jgt.22789openalex-snapshot
Eigenvalues and [a,b]‐factors in regular graphs
inferred← citeshttps://doi.org/10.1002/jgt.23089openalex-snapshot
Finding triangle‐free 2‐factors in general graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1002/jgt.3190090107openalex-snapshot
Regular factors of regular graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090111openalex-snapshot
[a,b]‐factorization of a graph
inferred← citeshttps://doi.org/10.1002/jgt.3190090412openalex-snapshot
Some conditions for the existence of f ‐factors
inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_24openalex-snapshot
Zero-Sum Flow Numbers of Triangular Grids
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-29700-7_25openalex-snapshot
Zero-Sum Flow Numbers of Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_1openalex-snapshot
Claude Berge — Sculptor of Graph Theory
inferred← citeshttps://doi.org/10.1007/bf01787702openalex-snapshot
Paths and cycles concerning independent edges
inferred← citeshttps://doi.org/10.1007/bf01788668openalex-snapshot
On the factor-thickness of regular graphs
inferred← citeshttps://doi.org/10.1007/bf02024498openalex-snapshot
On maximal paths and circuits of graphs
inferred← citeshttps://doi.org/10.1007/bf02066678openalex-snapshot
Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
inferred← citeshttps://doi.org/10.1007/bf02579252openalex-snapshot
Maximal tight sets and the edmonds—Gallai decomposition for matchings
inferred← citeshttps://doi.org/10.1007/s00373-004-0587-7openalex-snapshot
Connected Factors in Graphs ? a Survey
inferred← citeshttps://doi.org/10.1007/s00373-013-1324-xopenalex-snapshot
{k, r – k}-Factors of r-Regular Graphs
inferred← citeshttps://doi.org/10.1007/s40840-016-0410-7openalex-snapshot
Induced claws and existence of even factors of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90108-3openalex-snapshot
A factorization theorem for a certain class of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90030-xopenalex-snapshot
Regular factors in nearly regular 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(92)90640-2openalex-snapshot
Matching theory—a sampler: from Dénes König to the present
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/0095-8956(84)90052-2openalex-snapshot
A generalization of Tutte's 1-factor theorem to countable graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90072-8openalex-snapshot
Counting 1-factors in infinite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.03.018openalex-snapshot
Equitable factorizations of edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2003.11.017openalex-snapshot
A note on edge-decompositions of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113290openalex-snapshot
Eigenvalues and parity factors in graphs with given minimum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115278openalex-snapshot
2-factor with at most two components under a degree sum condition
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.05.007openalex-snapshot
Regular factors and eigenvalues of regular graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.023openalex-snapshot
1-restricted Simple 2-matchings
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00166-0openalex-snapshot
Regular factors of simple regular graphs and factor-spectra
inferred← citeshttps://doi.org/10.1017/s0305004100046831openalex-snapshot
Matchings in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/893/1/012039openalex-snapshot
Characterization of completelyk-magic regular graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1957-0083725-9openalex-snapshot
Graphs and Subgraphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16409.xopenalex-snapshot
Regular Subgraphs of a Regular Graph
inferred← citeshttps://doi.org/10.1137/070697409openalex-snapshot
Polyhedral Results for 1-Restricted Simple 2-Matchings
inferred← citeshttps://doi.org/10.1137/090760416openalex-snapshot
Maximum Cardinality Simple 2-matchings in Subcubic Graphs
inferred← citeshttps://doi.org/10.1137/120895792openalex-snapshot
On the Existence of General Factors in Regular Graphs
inferred← citeshttps://doi.org/10.12988/ams.2015.56438openalex-snapshot
On completely k-magic regular graphs
inferred← citeshttps://doi.org/10.2206/kyushujm.66.291openalex-snapshot
PERFECT MATCHINGS OF FISHER GRAPHS OF CUBIC GRAPHS
inferred← citeshttps://doi.org/10.3390/sym18060920openalex-snapshot
Colored Degree Factors in Regular and Triangle-Inflated Cubic Graphs
inferred← citeshttps://doi.org/10.37236/431openalex-snapshot
Regular Factors of Regular Graphs from Eigenvalues
inferred← citeshttps://doi.org/10.37236/991openalex-snapshot
Maximum Cardinality 1-Restricted Simple 2-Matchings
inferred← citeshttps://doi.org/10.4236/am.2026.171004openalex-snapshot
Forbidden Subgraphs for the Existence of an Even Factor with Exactly Two Components in 2-Edge-Connected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0748openalex-snapshot
A Note on $\{k,n-k\}$-Factors of Regular Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1812.11640openalex-snapshot
Factors and connected factors in tough graphs with high isolated toughness
inferred← citeshttps://doi.org/10.5614/ejgta.2013.1.1.5openalex-snapshot
Note on parity factors of regular 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.