On the public citation graph
On the structure of factorizable graphs
0 signed · 111 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/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
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(70)80033-3openalex-snapshot
Subgraphs with prescribed valencies
inferredcites →https://doi.org/10.1090/s0002-9904-1948-09098-xopenalex-snapshot
Distinct representatives of subsets
inferredcites →https://doi.org/10.1090/s0002-9947-1957-0083725-9openalex-snapshot
Graphs and Subgraphs
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0110650-9openalex-snapshot
Graphs and Subgraphs, II
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.4602258openalex-extracted
Cubic Vertices of Minimal Bicritical Graphs1
inferred← citeshttps://doi.org/10.1002/1097-0118(200012)35:4<227::aid-jgt1>3.0.co;2-dopenalex-snapshot
On the structure of graphs with a uniquek-factor
inferred← citeshttps://doi.org/10.1002/jgt.21873openalex-snapshot
3‐Factor‐Criticality of Vertex‐Transitive Graphs
inferred← citeshttps://doi.org/10.1002/jgt.23080openalex-snapshot
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.23190openalex-snapshot
Basilica: New canonical decomposition in matching theory
inferred← citeshttps://doi.org/10.1002/jgt.3190040107openalex-snapshot
Bigraphs versus digraphs via matrices
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
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.1006/jctb.1998.1824openalex-snapshot
The Two Ear Theorem on Matching-Covered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_29openalex-snapshot
Matching Extendability in Cartesian Product of Hypercubes and Paths
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_30openalex-snapshot
Extending Unlocked Matchings in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-71150-8_20openalex-snapshot
Structure of Towers and a New Proof of the Tight Cut Lemma
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_25openalex-snapshot
Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_20openalex-snapshot
The Path-Packing Structure of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_29openalex-snapshot
Minsquare Factors and Maxfix Covers of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_14openalex-snapshot
Recent Progress in Matching Extension
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-21919-1openalex-snapshot
Factors and Factorizations of Graphs: Proof Techniques in Factor Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_16openalex-snapshot
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/bf01581025openalex-snapshot
Rank of maximum matchings in a graph
inferred← citeshttps://doi.org/10.1007/bf02122558openalex-snapshot
The Schrijver system of odd join polyhedra
inferred← citeshttps://doi.org/10.1007/bf02579231openalex-snapshot
The edmonds—Gallai decomposition for matchings in locally finite graphs
inferred← citeshttps://doi.org/10.1007/bf02579233openalex-snapshot
Brick decompositions and the matching rank of graphs
inferred← citeshttps://doi.org/10.1007/bf02579252openalex-snapshot
Maximal tight sets and the edmonds—Gallai decomposition for matchings
inferred← citeshttps://doi.org/10.1007/bf02579264openalex-snapshot
A las vegas rnc algorithm for maximum matching
inferred← citeshttps://doi.org/10.1007/bf02579346openalex-snapshot
Ear-decompositions of matching-covered graphs
inferred← citeshttps://doi.org/10.1007/bfb0120895openalex-snapshot
Dual integrality in b-matching problems
inferred← citeshttps://doi.org/10.1007/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferred← citeshttps://doi.org/10.1007/s00373-010-0878-0openalex-snapshot
Elementary Graphs with Respect to f-Parity Factors
inferred← citeshttps://doi.org/10.1007/s00373-014-1463-8openalex-snapshot
On Graphs with a Unique Perfect Matching
inferred← citeshttps://doi.org/10.1007/s00373-019-02118-yopenalex-snapshot
Matching Extendability and Connectivity of Regular Graphs from Eigenvalues
inferred← citeshttps://doi.org/10.1007/s00373-020-02164-xopenalex-snapshot
Hamiltonian Cycle Properties in k-Extendable Non-bipartite Graphs with High Connectivity
inferred← citeshttps://doi.org/10.1007/s00373-023-02656-6openalex-snapshot
Minimally k-Factor-Critical Graphs for Some Large k
inferred← citeshttps://doi.org/10.1007/s00453-016-0252-6openalex-snapshot
Matchings with Lower Quotas: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/s11424-006-0491-8openalex-snapshot
Degree Conditions for Graphs to be Fractional (a, b, n)-Critical Graphs
inferred← citeshttps://doi.org/10.1007/s12190-008-0125-5openalex-snapshot
Binding number and minimum degree for the existence of (g,f,n)-critical graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90058-xopenalex-snapshot
Algorithmic proofs of two relations between connectivity and the 1-factors of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90235-6openalex-snapshot
On a generalization of linecritical graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90006-6openalex-snapshot
Matchings in regular graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90221-xopenalex-snapshot
Toughness and matching extension in graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00485-aopenalex-snapshot
Extending matchings in graphs: A survey
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/0012-365x(94)00154-8openalex-snapshot
On 2-extendable abelian Cayley graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90062-4openalex-snapshot
On minimal elementary bipartite graphs
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(84)90044-3openalex-snapshot
Maximum graphs with a unique k-factor
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90021-9openalex-snapshot
Matching structure and the matching lattice
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of 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/b978-044488002-4/50004-xopenalex-snapshot
10.1016/b978-044488002-4/50004-x
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.022openalex-snapshot
Signed analogue of general Kotzig–Lovász decomposition
inferred← citeshttps://doi.org/10.1016/j.dam.2021.06.005openalex-snapshot
Minimum k -critical bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.08.024openalex-snapshot
Graft Analogue of general Kotzig–Lovász decomposition
inferred← citeshttps://doi.org/10.1016/j.dam.2022.09.014openalex-snapshot
Some tight bounds on the minimum and maximum forcing numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.08.012openalex-snapshot
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
inferred← citeshttps://doi.org/10.1016/j.dam.2024.03.018openalex-snapshot
Cubic vertices of minimal bicritical graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.020openalex-snapshot
Perfect k -matching, k -factor-critical and Aα -spectral radius
inferred← citeshttps://doi.org/10.1016/j.disc.2004.09.010openalex-snapshot
A new degree condition for graphs to have [a,b] -factor
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.025openalex-snapshot
Construction for bicritical graphs and k-extendable bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.07.016openalex-snapshot
On the maximum number of edges in a hypergraph with a unique perfect matching
inferred← citeshttps://doi.org/10.1016/j.disc.2012.01.017openalex-snapshot
On the size and structure of graphs with a constant number of 1-factors
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112892openalex-snapshot
Spectral radius and [a,b]-factors in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113839openalex-snapshot
Minimum degree of minimal (n-10)-factor-critical graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.01.001openalex-snapshot
Max-cut and extendability of matchings in distance-regular graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.02.017openalex-snapshot
A note on m -near-factor-critical graphs
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2020.01.027openalex-snapshot
Irreducible decomposition of powers of edge ideals
inferred← citeshttps://doi.org/10.1016/j.laa.2023.06.002openalex-snapshot
Matching extension and distance spectral radius
inferred← citeshttps://doi.org/10.1016/j.laa.2024.08.004openalex-snapshot
Perfect integer k-matching, k-factor-critical, and the spectral radius of graphs
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/s0167-5060(08)70389-3openalex-snapshot
Matching Extensions and Products of Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70798-2openalex-snapshot
Toughness and Matching Extension in Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72455-1openalex-snapshot
Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73381-4openalex-snapshot
Sur Les Couplages Dans Les Graphes Localement Finis
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80160-xopenalex-snapshot
On the structure of graphs with a unique k-factor
inferred← citeshttps://doi.org/10.1017/s1446788700032730openalex-snapshot
Operations preserving the pfaffian property of a graph
inferred← citeshttps://doi.org/10.1080/00927872.2025.2459250openalex-snapshot
Irreducible decomposition of powers of edge ideals, computing dstab, astab.
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16422.xopenalex-snapshot
Some Recent Results on Graph Matchinga
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16425.xopenalex-snapshot
On the Star Packing Problem
inferred← citeshttps://doi.org/10.1112/plms/s3-30.2.160openalex-snapshot
On a Family of Planar Bicritical Graphs
inferred← citeshttps://doi.org/10.1137/060651136openalex-snapshot
Minconvex Factors of Prescribed Size in Graphs
inferred← citeshttps://doi.org/10.15807/jorsj.57.15openalex-snapshot
AN ALTERNATIVE PROOF OF LOVASZ'S CATHEDRAL THEOREM
inferred← citeshttps://doi.org/10.37236/4142openalex-snapshot
The Extendability of Matchings in Strongly Regular Graphs
inferred← citeshttps://doi.org/10.37236/4807openalex-snapshot
4-Factor-Criticality of Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7597openalex-snapshot
The Third Proof of Lovász's Cathedral Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1512.08870openalex-snapshot
A Graph Theoretic Proof of the Tight Cut Lemma
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07414openalex-snapshot
Bidirected Graphs I: Signed General Kotzig-Lovász Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.2105.11167openalex-snapshot
Constructive Characterization of Critical Bipartite Grafts
inferred← citeshttps://doi.org/10.7151/dmgt.2504openalex-snapshot
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
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.