Binding numbers for fractional ID-k-factor-critical graphs
DOI10.1007/S10114-013-1396-9zbMATH Open1287.05124OpenAlexW2140329547MaRDI QIDQ2440503FDOQ2440503
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
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
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)
Cites Work
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Fractional \((g,f)\)-factors of graphs
- Degree conditions of fractional ID-\(k\)-factor-critical graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- The binding number of a graph and its Anderson number
- A minimum degree condition of fractional \((k,m)\)-deleted graphs
- A sufficient condition for a graph to be an (a, b, k)-critical graph
- The existence of \(k\)-factors in squares of graphs
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- On fractional \((f,n)\)-critical graphs
- Binding numbers and connected factors
- Independent-set-deletable factor-critical power graphs
- Title not available (Why is that?)
- Some new sufficient conditions for graphs to have fractional \(k\)-factors
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
- Title not available (Why is that?)
- 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)
