A toughness condition for fractional (k,m)-deleted graphs
From MaRDI portal
Publication:2377232
DOI10.1016/J.IPL.2013.01.021zbMATH Open1273.05128OpenAlexW2008496735MaRDI QIDQ2377232FDOQ2377232
Hui Ye, Sizhong Zhou, Zhiren Sun
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
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 (14)
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Remarks on fractional ID-\(k\)-factor-critical graphs
- The existence of subdigraphs with orthogonal factorizations in digraphs
- Subgraphs with orthogonal factorizations in graphs
- Some existence theorems on path factors with given properties in graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- Some results on path-factor critical avoidable graphs
- Toughness for fractional \((2, b, k)\)-critical covered 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
- A neighborhood condition for graphs to have restricted fractional (g,f)-factors
- Title not available (Why is that?)
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)
