A toughness condition for fractional \((k,m)\)-deleted graphs

DOI10.1016/j.ipl.2013.01.021zbMath1273.05128OpenAlexW2008496735MaRDI QIDQ2377232

Hui Ye, Zhi-ren Sun, Si-zhong Zhou

Publication date: 28 June 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.021

zbMATH Keywords

graphcombinatorial problemstoughnessfractional \((k, m)\)-deleted graphfractional \(k\)-factor

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42)

Related Items (13)

The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ Research on fractional 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 ⋮ A toughness condition for fractional \((k, m)\)-deleted graphs revisited ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted ⋮ Some results on path-factor critical avoidable graphs

This page was built for publication: A toughness condition for fractional \((k,m)\)-deleted graphs