A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

DOI10.1016/j.dam.2021.05.022zbMath1502.05209OpenAlexW3168478447MaRDI QIDQ2091817

Si-zhong Zhou

Publication date: 2 November 2022

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

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

zbMATH Keywords

neighborhood unionfractional \((a, b, k)\)-covered graphfractional \((a, b, k)\)-critical covered graphfractional \((a, b, k)\)-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (21)

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 ⋮ Component factors and binding number conditions in graphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ 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] ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ 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 ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ The \(A_\alpha\)-spectral radius for path-factors in 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] ⋮ On \(P_{\geq 3}\)-factor deleted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 2-factors with the bounded number of components in line graphs
• Characterizations of maximum fractional \((g,f)\)-factors of graphs
• A neighbourhood condition for graphs to have \([a,b\)-factors]
• A generalization of orthogonal factorizations in digraphs
• A degree condition for fractional \([a,b\)-covered graphs]
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• Some results on path-factor critical avoidable 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
• Closure operation for even factors on claw-free graphs
• Neighborhood union conditions for fractional \([a, b\)-covered graphs]
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle]
• TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
• New isolated toughness condition for fractional $(g,f,n)$-critical graphs
• Remarks on path factors in graphs
• Isolated toughness and path-factor uniform graphs
• On k-orthogonal factorizations in networks
• Some results about component factors in graphs

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