Binding numbers for fractional ID-\(k\)-factor-critical graphs
From MaRDI portal
Publication:2440503
DOI10.1007/s10114-013-1396-9zbMath1287.05124OpenAlexW2140329547MaRDI QIDQ2440503
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fractional graph theory, fuzzy graph theory (05C72)
Related Items
A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ 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 existence theorems on path factors with given properties in graphs ⋮ Stability Number and k-Hamiltonian [a, b-factors] ⋮ Some results about component factors in graphs
Cites Work
- Unnamed Item
- Binding numbers and connected factors
- Degree conditions of fractional ID-\(k\)-factor-critical graphs
- The existence of \(k\)-factors in squares of graphs
- On fractional \((f,n)\)-critical graphs
- A minimum degree condition of fractional \((k,m)\)-deleted graphs
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Independent-set-deletable factor-critical power graphs
- Toughness and the existence of fractional \(k\)-factors of 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
- Some new sufficient conditions for graphs to have fractionalk-factors
- The binding number of a graph and its Anderson number
- Fractional \((g,f)\)-factors of graphs
This page was built for publication: Binding numbers for fractional ID-\(k\)-factor-critical graphs
