Toughness and the existence of fractional \(k\)-factors of graphs
From MaRDI portal
Publication:2477400
DOI10.1016/j.disc.2006.09.048zbMath1136.05059OpenAlexW1988845443MaRDI QIDQ2477400
Publication date: 13 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.048
Related Items (30)
Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS] ⋮ An existence theorem on fractional deleted graphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ The existence of \(P_{\geq3}\)-factor covered graphs ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Toughness and \((a,b,k)\)-critical graphs ⋮ A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ Research on fractional critical covered graphs ⋮ On toughness and fractional \((g,f,n)\)-critical graphs ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ Some new sufficient conditions for graphs to have fractionalk-factors ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH ⋮ NEIGHBOURHOOD 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 ⋮ A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs ⋮ A toughness condition for fractional \((k, m)\)-deleted graphs revisited ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS ⋮ A minimum degree condition of fractional \((k,m)\)-deleted graphs ⋮ Tight isolated toughness bound for fractional \((k, n)\)-critical graphs ⋮ BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
Cites Work
This page was built for publication: Toughness and the existence of fractional \(k\)-factors of graphs
