On the public citation graph

A sufficient condition for a graph to have [a, b]-factors

0 signed · 26 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.3190120115openalex-snapshot
A sufficient condition for a bipartite graph to have a k‐factor
inferredcites →https://doi.org/10.1002/jgt.3190120305openalex-snapshot
Some results on odd factors of graphs
inferredcites →https://doi.org/10.1007/bf02579180openalex-snapshot
Graph factors
inferredcites →https://doi.org/10.1016/0012-365x(82)90048-6openalex-snapshot
On factors with given components
inferredcites →https://doi.org/10.1016/0095-8956(71)90041-4openalex-snapshot
Perfect matchings of a graph
inferredcites →https://doi.org/10.1016/0095-8956(73)90038-5openalex-snapshot
The binding number of a graph and its Anderson number
inferredcites →https://doi.org/10.1016/1385-7258(78)90034-3openalex-snapshot
On the existence of subgraphs with degree constraints
inferredcites →https://doi.org/10.1016/s0021-9800(70)80033-3openalex-snapshot
Subgraphs with prescribed valencies

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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/s00373-004-0587-7openalex-snapshot
Connected Factors in Graphs ? a Survey
inferred← citeshttps://doi.org/10.1007/s10255-018-0773-7openalex-snapshot
Neighborhood Conditions for Fractional ID-k-factor-critical Graphs
inferred← citeshttps://doi.org/10.1007/s10255-021-1034-8openalex-snapshot
A Result on Fractional (a, b, k)-critical Covered Graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90053-zopenalex-snapshot
Binding numbers and f-factors of graphs
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.laa.2022.12.018openalex-snapshot
Two sufficient conditions for odd [1,b]-factors in graphs
inferred← citeshttps://doi.org/10.1017/s000497270003968xopenalex-snapshot
Notes on the binding numbers for (a, b, k)-critical graphs
inferred← citeshttps://doi.org/10.1080/00207160902777914openalex-snapshot
A sufficient condition for a graph to be an (a, b, k)-critical graph
inferred← citeshttps://doi.org/10.1201/b16132-22openalex-snapshot
Chinese Postman Problems
inferred← citeshttps://doi.org/10.1201/b16132-32openalex-snapshot
Factors and Factorization
inferred← citeshttps://doi.org/10.2298/fil2416885zopenalex-snapshot
Some properties of (a, b, k)-critical graphs
inferred← citeshttps://doi.org/10.2298/fil2420235zopenalex-snapshot
A new result on orthogonal factorizations in networks
inferred← citeshttps://doi.org/10.2298/pim1715205yopenalex-snapshot
Neighbourhood conditions for fractional ID-[a, b]-factor-critical graphs
inferred← citeshttps://doi.org/10.4153/cmb-2010-034-8openalex-snapshot
A New Sufficient Condition for a Graph To Be (g, f, n)-Critical
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.