A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs

DOI10.1016/j.aml.2011.03.041zbMath1218.05159OpenAlexW2080172880MaRDI QIDQ548404

Si-zhong Zhou

Publication date: 28 June 2011

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

Full work available at URL: https://doi.org/10.1016/j.aml.2011.03.041

zbMATH Keywords

graph\(k\)-factorfractional \(k\)-factorbinding numberfractional (\(k\)

Mathematics Subject Classification ID

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

Related Items

A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS] ⋮ 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 ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs ⋮ An independent set degree condition for fractional critical deleted graphs ⋮ BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS ⋮ STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On fractional \((f,n)\)-critical graphs
• Neighborhood conditions and fractional \(k\)-factors
• Some results on fractional \(k\)-factors
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
• A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• A result on fractional $k$-deleted graphs
• Some remarks about factors of graphs
• The binding number of a graph and its Anderson number
• Fractional \((g,f)\)-factors of graphs

This page was built for publication: A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs