Binding numbers for fractional ID-k-factor-critical graphs

DOI10.1007/S10114-013-1396-9MaRDI QIDQ2440503zbMATH OpenOpenAlexFDO

Authors Sizhong Zhou

Publication date 18 March 2014

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-013-1396-9

zbMATH Keywords

independent setfractional \(k\)-factorbinding numberfractional ID-\(k\)-factor-critical

Mathematics Subject Classification ID

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) Fractional graph theory, fuzzy graph theory (05C72)

Recommendations

• Binding number and minimum degree for fractional ID-\(k\)-fractor-critical graphs
• Binding numbers and fractional \((g,f,n)\)-critical graphs
• Binding numbers for all fractional \((a,b,k)\)-critical graphs
• Binding numbers for fractional \((a, b, k)\)-critical covered graphs
• Binding numbers of graphs and existence of fractional factors
• scientific article; zbMATH DE number 5041506
• Binding number and fractional \(k\)-factors of graphs.
• Binding numbers and restricted fractional ( g , f )-factors in graphs
• A result on fractional ID-k-factor-critical graphs
• Remarks on fractional ID-\(k\)-factor-critical graphs

Cites work

• scientific article; zbMATH DE number 5138378 (Why is no real title available?)
• A minimum degree condition of fractional \((k,m)\)-deleted graphs
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Binding numbers and connected factors
• Degree conditions of fractional ID-k-factor-critical graphs
• Fractional \((g,f)\)-factors of graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Independent-set-deletable factor-critical power graphs
• On fractional \((f,n)\)-critical graphs
• Some new sufficient conditions for graphs to have fractional \(k\)-factors
• The binding number of a graph and its Anderson number
• The existence of k-factors in squares of graphs
• Toughness and the existence of fractional k-factors of graphs

Cited in

(10)

• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
• Some existence theorems on path factors with given properties in graphs
• A Note of Generalization of Fractional ID-factor-critical Graphs
• Some results about ID-path-factor critical graphs
• scientific article; zbMATH DE number 5041506 (Why is no real title available?)
• An existence theorem on fractional deleted graphs
• A new blow-up criterion for the \(N - abc\) family of Camassa-Holm type equation with both dissipation and dispersion
• Some results about component factors in graphs
• Binding number and minimum degree for fractional ID-\(k\)-fractor-critical graphs
• Stability number and \(k\)-Hamiltonian \([a,b]\)-factors

This page was built for publication: Binding numbers for fractional ID-\(k\)-factor-critical graphs

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