A degree condition for graphs to be fractional ID-[a,b]-factor-critical
From MaRDI portal
Publication:2820205
Recommendations
- A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
- A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
- Degree sum condition for fractional ID-\(k\)-factor-critical graphs
- Toughness and degree condition for fractional ID-k-factor-critical graphs
- Degree conditions of fractional ID-k-factor-critical graphs
Cited in
(11)- A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- An independent set degree condition for fractional critical deleted graphs
- Degree conditions for graphs to be fractional (a, b, n)-critical graphs
- A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
- A result on fractional ID-\([a,b]\)-factor-critical graphs
- A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
- A Note of Generalization of Fractional ID-factor-critical Graphs
- The degree sum condition of ID-factor-critical graphs
- scientific article; zbMATH DE number 6606170 (Why is no real title available?)
- Spectral radius, fractional $[a,b]$-factor and ID-factor-critical graphs
This page was built for publication: A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820205)