Nash-Williams conditions for the existence of all fractional [a,b]-factors
From MaRDI portal
Publication:2243085
minimum degreestability numberall fractional \([a,b\)-factors]fractional \([a,b\)-factor]
Recommendations
Cites work
- scientific article; zbMATH DE number 165085 (Why is no real title available?)
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- A degree condition for the existence ofk-factors
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs
- Graph factors and factorization: 1985--2003: a survey
- Isolated toughness and path-factor uniform graphs
- New isolated toughness condition for fractional \((g,f,n)\)-critical graphs
- On \(k\)-orthogonal factorizations in networks
- On all fractional \({(a,b,k)}\)-critical graphs
- Path factors in subgraphs
- Remarks on path factors in graphs
- Research on fractional critical covered graphs
- Simplified existence theorems on all fractional \([a,b]\)-factors
- Some new sufficient conditions for graphs to have fractional \(k\)-factors
- Subgraphs with orthogonal factorizations in graphs
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Toughness and the existence of fractional \(k\)-factors of graphs
- \(f\)-factors, complete-factors, and component-deleted subgraphs
Cited in
(6)- All fractional \([a,b]\)-factors with prescribed properties.
- The extension degree conditions for fractional factor
- scientific article; zbMATH DE number 6902656 (Why is no real title available?)
- Simplified existence theorems on all fractional \([a,b]\)-factors
- The existence of all fractional \([a,b]\)-factors in networks
- Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors
This page was built for publication: Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243085)
