Some new sufficient conditions for graphs to have fractionalk-factors

DOI10.1080/00207161003681286zbMath1230.05243OpenAlexW2053623484MaRDI QIDQ5391502

Si-zhong Zhou

Publication date: 6 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207161003681286

zbMATH Keywords

graphminimum degreeindependent numberfractional \(k\)-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

A sufficient condition for the existence of a k-factor excluding a given r-factor ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Some results about component factors in graphs ⋮ BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs

Cites Work

• Unnamed Item
• A minimum degree condition of fractional \((k,m)\)-deleted graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• The dynamics of a prey-dependent consumption model concerning integrated pest management
• A degree condition for the existence ofk-factors

This page was built for publication: Some new sufficient conditions for graphs to have fractionalk-factors