A result on fractional \((a,b,k)\)-critical covered graphs

DOI10.1007/s10255-021-1034-8zbMath1484.05175arXiv1912.12542OpenAlexW3206239925MaRDI QIDQ2240647

Si-zhong Zhou

Publication date: 4 November 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.12542

zbMATH Keywords

fractional graph theorygraph factors

Mathematics Subject Classification ID

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

Related Items (11)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Discussions on orthogonal factorizations in digraphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ On \(P_{\geq 3}\)-factor deleted graphs

Cites Work

• Unnamed Item
• On factors with given components
• A sufficient condition for a graph to have \([a,b\)-factors]
• A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs]
• Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
• A degree condition for fractional \([a,b\)-covered graphs]
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Some results on path-factor critical avoidable graphs
• Component factors and binding number conditions in graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Subgraphs with orthogonal factorizations in graphs
• Research on fractional critical covered graphs
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
• Remarks on path factors in graphs
• NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS
• Isolated toughness and path-factor uniform graphs
• On k-orthogonal factorizations in networks

This page was built for publication: A result on fractional \((a,b,k)\)-critical covered graphs