Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
From MaRDI portal
Publication:1753364
DOI10.1007/S10255-018-0753-YzbMath1387.05214arXiv1412.3497OpenAlexW2964082890MaRDI QIDQ1753364
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (9)
A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Spectral radius conditions for fractional \([a,b\)-covered graphs] ⋮ A degree condition for fractional \([a,b\)-covered graphs] ⋮ The extension degree conditions for fractional factor ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ Neighborhood union conditions for fractional \([a, b\)-covered graphs] ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
Cites Work
- Unnamed Item
- A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs]
- Sufficient condition for the existence of an even \([a,b\)-factor in graph]
- Regular factors and eigenvalues of regular graphs
- A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
- Binding numbers of fractional \(k\)-deleted graphs
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- A characterization of graphs having all \((g,f)\)-factors
- Complete factors and \(f\)-factors
- Simplified existence theorems for \((g,f)\)-factors
- On 2-factors with a bounded number of odd components
- Simplified existence theorems on all fractional \([a,b\)-factors]
- On all fractional \({(a,b,k)}\)-critical graphs
- TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
- Remarks on orthogonal factorizations of digraphs
- A sufficient condition for a graph to be an (a, b, k)-critical graph
- Some results about component factors in graphs
- Subgraphs with prescribed valencies
- Fractional \((g,f)\)-factors of graphs
This page was built for publication: Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties