Some new sufficient conditions for graphs to have fractional k-factors
DOI10.1080/00207161003681286zbMATH Open1230.05243OpenAlexW2053623484MaRDI QIDQ5391502FDOQ5391502
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
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
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)
Cites Work
Cited In (21)
- Remarks on restricted fractional \((g, f)\)-factors in graphs
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Binding number and minimum degree for fractional \((k,m)\)-deleted graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Title not available (Why is that?)
- Fractional \(\ell\)-factors in regular graphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
