Some existence theorems on all fractional (g,f)-factors with prescribed properties
DOI10.1007/S10255-018-0753-YzbMATH Open1387.05214arXiv1412.3497OpenAlexW2964082890WikidataQ129909040 ScholiaQ129909040MaRDI QIDQ1753364FDOQ1753364
Authors: Sizhong Zhou, Tao Zhang
Publication date: 29 May 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3497
Recommendations
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
- Simplified existence theorems on all fractional \([a,b]\)-factors
- A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
- Fractional \((g,f)\)-factors of graphs
- Subgraphs with prescribed valencies
- Binding numbers of fractional \(k\)-deleted graphs
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Complete factors and \(f\)-factors
- Regular factors and eigenvalues of regular graphs
- A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
- A sufficient condition for a graph to be an (a, b, k)-critical graph
- Simplified existence theorems for \((g,f)\)-factors
- A characterization of graphs having all \((g,f)\)-factors
- Fractional \((g,f)\)-factors in graphs
- Some results about component factors in graphs
- On all fractional \({(a,b,k)}\)-critical graphs
- Remarks on orthogonal factorizations of digraphs
- On 2-factors with a bounded number of odd components
- Tight toughness condition for fractional \((g,f,n)\)-critical graphs
Cited In (18)
- The extension degree conditions for fractional factor
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
- All fractional \((g,f)\)-factors in graphs
- An improvement and generalization of all fractional factors in graphs
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs
- On fractional \((g, f, n^\prime, m)\)-critical covered graphs
- Spectral radius conditions for fractional \([a,b]\)-covered graphs
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- Independence number and fractional \((g,f)\)-factors with inclusion and exclusion properties
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- Title not available (Why is that?)
- Existence of all generalized fractional \((g, f)\)-factors of graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Simplified existence theorems on all fractional \([a,b]\)-factors
- The existence of fractional \((g,f)\)-factors in networks
- A degree condition for fractional \([a,b]\)-covered graphs
This page was built for publication: Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753364)