Binding numbers for fractional (a, b, k)-critical covered graphs

MaRDI QIDQ5065860zbMATH OpenFDO

Authors Hongxia Liu, Sizhong Zhou, Yang Xu

Publication date 22 March 2022

zbMATH Keywords

binding numberfractional \((a, b, k)\)-critical covered graphfractional \([a, b\)-covered graph]fractional \([a, b\)-factor]

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Recommendations

• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Notes on fractional (a, b, k)-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Research on fractional critical covered graphs
• Discussion on fractional (a, b, k)-critical covered graphs

Cited in

(14)

• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• Some results on path-factor critical avoidable graphs
• Component factors and binding number conditions in graphs
• Path factors in subgraphs
• A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Neighborhood union conditions for fractional \([a, b]\)-covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Toughness for fractional \((2, b, k)\)-critical covered graphs
• A sufficient condition for fractional (2, b, k)-critical covered graphs
• Two sufficient conditions for component factors in graphs
• Isolated toughness condition for fractional (a, b, m)-covered graphs

This page was built for publication: Binding numbers for fractional \((a, b, k)\)-critical covered graphs

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