On the public citation graph
On factors with all degrees odd
0 signed · 56 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-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1016/0012-365x(78)90006-7openalex-snapshot
An extension of Tutte's 1-factor theorem
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/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot
Combinatorial Problems and Exercises
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
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.22789openalex-snapshot
Eigenvalues and [a,b]‐factors in regular graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1002/jgt.3190120305openalex-snapshot
Some results on odd factors of graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_29openalex-snapshot
Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs
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-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/s00373-010-0878-0openalex-snapshot
Elementary Graphs with Respect to f-Parity Factors
inferred← citeshttps://doi.org/10.1007/s00373-021-02293-xopenalex-snapshot
A Characterization for Graphs Having Strong Parity Factors
inferred← citeshttps://doi.org/10.1007/s00373-025-02962-1openalex-snapshot
Spectral Conditions for a Graph to have Strong Parity Factors
inferred← citeshttps://doi.org/10.1007/s10255-024-1090-yopenalex-snapshot
A Degree Condition for Graphs Having All (a, b)-parity Factors
inferred← citeshttps://doi.org/10.1007/s40314-025-03478-3openalex-snapshot
Some results on the k-strong parity property in a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90378-fopenalex-snapshot
On some factor theorems of graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(87)90027-7openalex-snapshot
On T-joins and odd factors
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.003openalex-snapshot
A spectral condition for a graph to have strong parity factors
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.032openalex-snapshot
Binding number, odd [1,b] -factors and the distance spectral radius
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.2017.08.035openalex-snapshot
A degree condition for a graph to have (a,b) -parity factors
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111901openalex-snapshot
Characterization of 1-tough graphs using factors
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111906openalex-snapshot
An odd [ 1 , b ] -factor in regular graphs from eigenvalues
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.2022.112998openalex-snapshot
Spanning trees and spanning closed walks with small degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114593openalex-snapshot
Spectral extremal problems on factors in tough graphs, and beyond
inferred← citeshttps://doi.org/10.1016/j.laa.2010.04.002openalex-snapshot
Eigenvalues and [1,n] -odd factors
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/j.laa.2024.10.023openalex-snapshot
Spectral radius, odd [1,b]-factor and spanning k-tree of 1-binding graphs
inferred← citeshttps://doi.org/10.1016/s0252-9602(18)30401-6openalex-snapshot
EXTENSIONS OF SOME THEOREMS ON 1-FACTORS
inferred← citeshttps://doi.org/10.1051/ro/2023069openalex-snapshot
Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius
inferred← citeshttps://doi.org/10.1051/ro/2023147openalex-snapshot
Sufficient conditions for graphs to have strong parity factors
inferred← citeshttps://doi.org/10.1051/ro/2024223openalex-snapshot
An odd [1, b]-factor in a graph from signless Laplacian spectral radius
inferred← citeshttps://doi.org/10.1051/ro/2024237openalex-snapshot
Laplacian eigenvalue condition for a graph to have the strong parity property
inferred← citeshttps://doi.org/10.1080/03081087.2022.2158166openalex-snapshot
Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index
inferred← citeshttps://doi.org/10.1137/16m1079609openalex-snapshot
A Tutte-Type Characterization for Graph Factors
inferred← citeshttps://doi.org/10.1142/s0219265923500329openalex-snapshot
Bounds of Two Toughnesses and Binding Numbers for Star Factors
inferred← citeshttps://doi.org/10.11650/tjm/240301openalex-snapshot
The $A_{\alpha}$-spectral Radius and $[a,b]$-factors in Graphs
inferred← citeshttps://doi.org/10.2298/fil2522781xopenalex-snapshot
Matching, odd [1,b]-factor and distance spectral radius of graphs with given some parameters
inferred← citeshttps://doi.org/10.3390/math13101640openalex-snapshot
Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor
inferred← citeshttps://doi.org/10.5614/ejgta.2013.1.1.5openalex-snapshot
Note on parity factors of regular graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2158openalex-snapshot
Strong Tutte type conditions and factors of 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.