Binding number and minimum degree for fractional ID-k-fractor-critical graphs

MaRDI QIDQ5741017zbMATH OpenFDO

Authors Sizhong Zhou

Publication date 20 July 2016

zbMATH Keywords

minimum degreebinding numberfractional ID-\(k\)-factor-critical graphfractional \(k\)-fractor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Recommendations

• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
• Toughness and degree condition for fractional ID-\(k\)-factor-critical graphs
• Degree sum condition for fractional ID-\(k\)-factor-critical graphs
• Remarks on fractional ID-\(k\)-factor-critical graphs

Cited in

(4)

• Binding number and minimum degree for the existence of fractional \(k\)-factors with prescribed properties
• Some results about ID-path-factor critical graphs
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS

This page was built for publication: Binding number and minimum degree for fractional ID-\(k\)-fractor-critical graphs

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