On fractional (g, f, n^, m)-critical covered graphs
From MaRDI portal
Publication:6566786
DOI10.1007/S40305-022-00409-5MaRDI QIDQ6566786FDOQ6566786
Authors: Wei Gao, Weifan Wang 
Publication date: 3 July 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Recommendations
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Research on fractional critical covered graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- Notes on fractional \((a, b, k)\)-critical covered graphs
Cites Work
- An algorithmic proof of Tutte's f-factor theorem
- Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs
- Some results about component factors in graphs
- A result on \(r\)-orthogonal factorizations in digraphs
- Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
- Remarks on orthogonal factorizations of digraphs
- A degree condition for fractional \([a,b]\)-covered graphs
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- The extension degree conditions for fractional factor
- Remarks on fractional ID-\(k\)-factor-critical graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- A tight neighborhood union condition on fractional \((g,f,n',m)\)-critical deleted graphs
This page was built for publication: On fractional \((g, f, n^\prime, m)\)-critical covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566786)
