A sufficient condition for fractional ID-[a,b]-factor-critical covered graphs

MaRDI QIDQ5133261zbMATH OpenFDO

Authors Jiashang Jiang

Publication date 12 November 2020

zbMATH Keywords

neighborhood unionfractional \([a,b\)-factor]fractional ID-\([a,b\)-factor-critical covered graph]

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 7559987
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• Sharp conditions on fractional ID-\((g, f)\)-factor-critical covered graphs
• A result on fractional ID-\([a,b]\)-factor-critical graphs

Cited in

(10)

• A result on fractional \((a,b,k)\)-critical covered graphs
• scientific article; zbMATH DE number 6606170 (Why is no real title available?)
• Sharp conditions on fractional ID-\((g, f)\)-factor-critical covered graphs
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• On fractional ID-\((g,f)\)-factor-critical covered graphs.
• scientific article; zbMATH DE number 7559987 (Why is no real title available?)
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A degree condition for fractional \([a,b]\)-covered graphs

This page was built for publication: A sufficient condition for fractional ID-\([a,b]\)-factor-critical covered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133261)