Fractional \((g,f)\)-factors of graphs

DOI10.1016/S0252-9602(17)30443-5zbMath0989.05086MaRDI QIDQ5957123

Gui Zhen Liu, Lanju Zhang

Publication date: 14 July 2002

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

zbMATH Keywords

multigraphcharacterizationpolynomial algorithm\((g,f)\)-factoraugmenting path

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs], A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs], Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs, Some Results on Fractional Graph Theory, Graph factors and factorization: 1985--2003: a survey, Spectral radius conditions for fractional \([a,b\)-covered graphs], Binding numbers for fractional ID-\(k\)-factor-critical graphs, On toughness and fractional \((g,f,n)\)-critical graphs, A note on the existence of fractional \(f\)-factors in random graphs, A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs, Characterizations of maximum fractional \((g,f)\)-factors of graphs, Some results on fractional \(n\)-factor-critical graphs, Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties, Toughness and the existence of fractional \(k\)-factors of graphs, Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs, A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs, Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs, On fractional \((f,n)\)-critical graphs, Unnamed Item, Remarks on fractional ID-\(k\)-factor-critical graphs, A minimum degree condition of fractional \((k,m)\)-deleted graphs, Unnamed Item, Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]