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

DOI10.1016/J.IPL.2013.01.021MaRDI QIDQ2377232zbMATH OpenOpenAlexFDO

Authors Zhiren Sun, Hui Ye, Sizhong 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

combinatorial problemsfractional \((k, m)\)-deleted graphfractional \(k\)-factorgraphtoughness

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42)

Recommendations

• A sufficient condition for graphs to be fractional (k,m)-deleted graphs
• scientific article; zbMATH DE number 6302857
• A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• Neighborhood conditions for the existence of fractional k-factors with prescribed properties
• scientific article; zbMATH DE number 6424494

Cited in

(19)

• Some results on path-factor critical avoidable graphs
• The existence of subdigraphs with orthogonal factorizations in digraphs
• A degree condition for fractional (g, f, n)-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 for fractional \((2, b, k)\)-critical covered graphs
• Toughness and fractional critical deleted graph
• scientific article; zbMATH DE number 1819937 (Why is no real title available?)
• An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• Neighborhood conditions for the existence of fractional k-factors with prescribed properties
• A sufficient condition for graphs to be fractional (k,m)-deleted graphs
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
• Sharp isolated toughness bound for fractional \((k, m)\)-deleted graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377232)