Sufficient conditions for graphs to have strong parity factors

Cites Work

Unnamed Item
On factors with all degrees odd
Regular factors of simple regular graphs and factor-spectra
Toughness of graphs and the existence of factors
Packing paths of length at least two
A characterization for graphs having strong parity factors
Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Some results on path-factor critical avoidable graphs
Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors]
On path-factor critical deleted (or covered) graphs
A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
Research on fractional critical covered graphs
On specific factors in graphs
Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
A degree condition for a graph to have \((a,b)\)-parity factors
Fan-type results for the existence of [\(a\),\(b\)-factors]
Tough graphs and Hamiltonian circuits.
Two sufficient conditions for odd \([1,b\)-factors in graphs]
Some sufficient conditions for path-factor uniform graphs
Toughness and the existence ofk-factors
Some results on odd factors of graphs
Independence number, connectivity, and r‐factors
Stability number and [a,b‐factors in graphs]
On k-orthogonal factorizations in networks
A Note of Generalization of Fractional ID-factor-critical Graphs
Isolated toughness for path factors in networks
The existence of path-factor uniform graphs with large connectivity
TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
Path factors and neighborhoods of independent sets in graphs

This page was built for publication: Sufficient conditions for graphs to have strong parity factors