Some new sufficient conditions for graphs to have fractional k-factors

DOI10.1080/00207161003681286MaRDI QIDQ5391502zbMATH OpenOpenAlexFDO

Authors Sizhong 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A result on the existence of fractional \(k\)-factors in graphs
• Neighbourhood and the existence of fractional \(k\)-factors of graphs
• Some results on fractional \(k\)-factors
• Binding number and minimum degree for the existence of fractional \(k\)-factors with prescribed properties
• Neighborhood conditions for the existence of fractional \(k\)-factors with prescribed properties

Cites work

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

Cited in

(21)

• Remarks on restricted fractional \((g, f)\)-factors in graphs
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Binding number and minimum degree for fractional \((k,m)\)-deleted graphs
• scientific article; zbMATH DE number 5221493 (Why is no real title available?)
• Fractional \(\ell\)-factors in regular graphs
• scientific article; zbMATH DE number 2111180 (Why is no real title available?)
• Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
• Subgraphs with orthogonal factorizations in graphs
• Some existence theorems on path factors with given properties in graphs
• An existence theorem on Hamiltonian \((g,f)\)-factors in networks
• On all fractional \({(a,b,k)}\)-critical graphs
• Neighbourhood and the existence of fractional \(k\)-factors of graphs
• Fractional \(k\)-factors of graphs
• Characterizations of graphs \(G\) having all \([1, k]\)-factors in \(k G\)
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor
• Fractional \(k\)-factors in graphs
• A result on the existence of fractional \(k\)-factors in graphs
• scientific article; zbMATH DE number 7260013 (Why is no real title available?)
• Some results about component factors in graphs

This page was built for publication: Some new sufficient conditions for graphs to have fractional \(k\)-factors

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