A sufficient condition for fractional (2, b, k)-critical covered graphs

DOI10.61091/jcmcc120-17zbMATH Open1545.0519MaRDI QIDQ6586592FDOQ6586592

Authors: Jie Wu 

Publication date: 13 August 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Recommendations

• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Binding numbers for fractional \((a, b, k)\)-critical covered graphs
• Discussion on fractional \((a, b, k)\)-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Toughness for fractional \((2, b, k)\)-critical covered graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• The binding number of a graph and its Anderson number
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

Cited In (1)

• Toughness for fractional \((2, b, k)\)-critical covered graphs

This page was built for publication: A sufficient condition for fractional \((2, b, k)\)-critical covered graphs

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