A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs

DOI10.1016/j.dam.2021.03.004zbMath1494.05103OpenAlexW3146870419WikidataQ113877240 ScholiaQ113877240MaRDI QIDQ2161272

Yang Xu, Hongxia Liu, Si-zhong Zhou

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.03.004

zbMATH Keywords

minimum degreeneighborhoodfractional ID-\( [ a, b \)-factor]fractional ID-\( [ a, b \)-factor-critical covered graph]

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07) Communication theory (94A05)

Related Items (18)

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 ⋮ Path factors in subgraphs ⋮ Some results about ID-path-factor critical graphs ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Feasibility of data transmission under attack: from isolated toughness variant perspective ⋮ 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 ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Tight isolated toughness bound for fractional \((k, n)\)-critical graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ On \(P_{\geq 3}\)-factor deleted graphs

Cites Work

• Minimum degree, independence number and pseudo \([2, b\)-factors in graphs]
• A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs]
• A degree condition for fractional \([a,b\)-covered graphs]
• The extension degree conditions for fractional factor
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• Some results on path-factor critical avoidable graphs
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• Existence of all generalized fractional \((g, f)\)-factors of graphs
• Some existence theorems on path factors with given properties in 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
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• Remarks on fractional ID-\(k\)-factor-critical graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Toughness, binding number and restricted matching extension in a graph
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS]
• Remarks on path factors in graphs
• Degree sum condition for fractional ID-$k$-factor-critical graphs
• Some results about component factors in graphs
• Unnamed Item

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