On the public citation graph

Odd factors of a graph

0 signed · 27 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferredcites →https://doi.org/10.1002/jgt.3190120305openalex-snapshot
Some results on odd factors of graphs
inferredcites →https://doi.org/10.1002/jgt.3190130507openalex-snapshot
A note concerning graphs with unique f‐factors
inferredcites →https://doi.org/10.1007/bf02579180openalex-snapshot
Graph factors
inferredcites →https://doi.org/10.1007/bf02582935openalex-snapshot
On factors with all degrees odd
inferredcites →https://doi.org/10.1016/0012-365x(72)90088-xopenalex-snapshot
A graph polynomial and its applications
inferredcites →https://doi.org/10.1016/1385-7258(73)90007-3openalex-snapshot
The existence of 1-factors in line graphs, squares, and total 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.1090/s0002-9939-1974-0323648-6openalex-snapshot
Graphs with 1-Factors
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1112/jlms/s2-13.2.351openalex-snapshot
1-Factors and Antifactor Sets

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.20170openalex-snapshot
Covering the edges of a graph by three odd subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.21712openalex-snapshot
On Cui‐Kano's Characterization Problem on Graph Factors
inferred← citeshttps://doi.org/10.1002/jgt.21856openalex-snapshot
An Extension of Cui-Kano's Characterization on Graph Factors
inferred← citeshttps://doi.org/10.1002/jgt.v53:1openalex-snapshot
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_30openalex-snapshot
Notes on Fractional (1,f)-Odd Factors of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-93952-8openalex-snapshot
Graph Factors and Matching Extensions
inferred← citeshttps://doi.org/10.1007/s00373-004-0587-7openalex-snapshot
Connected Factors in Graphs ? a Survey
inferred← citeshttps://doi.org/10.1007/s00373-025-02982-xopenalex-snapshot
Signless Laplacian spectral conditions for k-critical graphs with respect to [1, b]-odd factors
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.2005.11.078openalex-snapshot
Structure theorem and algorithm on (1,f) -odd subgraph
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115251openalex-snapshot
Sufficient conditions for a graph with minimum degree to be k-critical with respect to an odd [1,b]-factor
inferred← citeshttps://doi.org/10.1016/j.laa.2022.12.018openalex-snapshot
Two sufficient conditions for odd [1,b]-factors in graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00424-1openalex-snapshot
Odd subgraphs and matchings
inferred← citeshttps://doi.org/10.26493/1855-3974.957.97copenalex-snapshot
Odd edge-colorability of subcubic graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4657openalex-snapshot
An Extension of Cui-Kano's Characterization Problem on Graph Factors
inferred← citeshttps://doi.org/10.7151/dmgt.1242openalex-snapshot
Even [a,b]-factors in 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.