On the public citation graph
1-Faktoren von Graphen
0 signed · 43 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/bf01304873openalex-snapshot
Ecken vom Gradn in minimalenn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01350321openalex-snapshot
Untersuchungen �ber minimalen-fach zusammenh�ngende Graphen
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferredcites →https://doi.org/10.1016/0095-8956(71)90041-4openalex-snapshot
Perfect matchings of a graph
inferredcites →https://doi.org/10.1016/0097-3165(71)90024-0openalex-snapshot
On polynomials and crossing numbers of complete graphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80029-2openalex-snapshot
On the 1-factors of a non-separable graph
inferredcites →https://doi.org/10.1016/s0021-9800(69)80049-9openalex-snapshot
A theorem on n-connected graphs
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4506735openalex-extracted
The Minimum Size of Matching-Saturated Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22132openalex-snapshot
Colored Saturation Parameters for Rainbow Subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190100209openalex-snapshot
Saturated graphs with minimal number of edges
inferred← citeshttps://doi.org/10.1002/jgt.3190130507openalex-snapshot
A note concerning graphs with unique f‐factors
inferred← citeshttps://doi.org/10.1002/mana.3210740117openalex-snapshot
Über die Anzahl der 1‐Faktoren in 2‐fach zusammenhängenden Graphen
inferred← citeshttps://doi.org/10.1007/3540185356_30openalex-snapshot
Some combinatorial problems concerning finite languages
inferred← citeshttps://doi.org/10.1007/978-3-642-21919-1openalex-snapshot
Factors and Factorizations of Graphs: Proof Techniques in Factor Theory
inferred← citeshttps://doi.org/10.1007/bf01351600openalex-snapshot
Endlichkeitss�tze f�rk-kritische Graphen
inferred← citeshttps://doi.org/10.1007/bf01896839openalex-snapshot
Über ein graphentheoretisches Ergebnis von T. Gallai
inferred← citeshttps://doi.org/10.1007/bf02579231openalex-snapshot
The edmonds—Gallai decomposition for matchings in locally finite graphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00566-4openalex-snapshot
Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90006-7openalex-snapshot
An extension of Tutte's 1-factor theorem
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/0095-8956(73)90038-5openalex-snapshot
The binding number of a graph and its Anderson number
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90002-8openalex-snapshot
Equipartite colorings in graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90011-4openalex-snapshot
The number of 1-factors in 2k-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90056-8openalex-snapshot
f-Factors and related decompositions of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90005-9openalex-snapshot
On the number of 1-factors of locally finite 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.12.012openalex-snapshot
Minimum tP3 -saturation graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.017openalex-snapshot
A note on the minimum size of matching-saturated graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.024openalex-snapshot
Saturation numbers of joins of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.024openalex-snapshot
Ramsey-minimal saturation numbers for matchings
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00248-6openalex-snapshot
On unique k-factors and unique [1,k]-factors in graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00160-4openalex-snapshot
Alternating Cycles and Paths in Edge-Coloured Multigraphs
inferred← citeshttps://doi.org/10.1017/s0963548300001152openalex-snapshot
On Vertex-Edge-Critically n-Connected Graphs
inferred← citeshttps://doi.org/10.4153/cmb-1978-030-4openalex-snapshot
Regular Partitions 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.