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

DOI10.1016/J.AML.2011.03.041zbMATH Open1218.05159OpenAlexW2080172880MaRDI QIDQ548404FDOQ548404

Sizhong 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

Recommendations

• scientific article; zbMATH DE number 6302857
• Binding number and minimum degree for fractional \((k,m)\)-deleted graphs
• A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• Neighborhood conditions for the existence of fractional \(k\)-factors with prescribed properties
• A toughness condition for fractional \((k,m)\)-deleted graphs

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)

Cites Work

• Graph theory
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Title not available (Why is that?)
• Fractional \((g,f)\)-factors of graphs
• Neighborhood conditions and fractional \(k\)-factors
• Toughness and the existence of fractional \(k\)-factors of graphs
• The binding number of a graph and its Anderson number
• A neighbourhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• Some remarks about factors of graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Some results on fractional \(k\)-factors
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A result on fractional $k$-deleted graphs
• Title not available (Why is that?)
• On fractional \((f,n)\)-critical graphs

Cited In (15)

• Title not available (Why is that?)
• An independent set degree condition for fractional critical deleted graphs
• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
• Title not available (Why is that?)
• A sufficient condition for the existence of a k-factor excluding a given r-factor
• Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
• Title not available (Why is that?)
• Some existence theorems on path factors with given properties in graphs
• BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS
• Title not available (Why is that?)
• A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• Binding number conditions for fractional \(k\)-deleted graphs
• Stability number and minimum degree for (\(a, b, k\))-critical graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548404)