An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs
From MaRDI portal
(Redirected from Publication:4604362)
An isolated toughness condition for graphs to be fractional (\(k, m\))-deleted graphs
An isolated toughness condition for graphs to be fractional (\(k, m\))-deleted graphs
Recommendations
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- An isolated toughness condition for fractional (a,b,n)-critical deleted graphs
- A toughness condition for fractional \((k,m)\)-deleted graphs
- New isolated toughness condition for fractional (g,f,n)-critical graphs
- scientific article; zbMATH DE number 6390837
Cited in
(13)- Parameters and fractional factors in different settings
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- Some results on path-factor critical avoidable graphs
- Modeling of hybrid nanofluid behavior within a permeable media involving buoyancy effect
- Investigation of hybrid nanofluid migration within a porous closed domain
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- scientific article; zbMATH DE number 6390837 (Why is no real title available?)
- An isolated toughness condition for fractional (a,b,n)-critical deleted graphs
- Toughness, isolated toughness and path factors in graphs
- Sun toughness and path-factor uniform graphs
- Sharp isolated toughness bound for fractional \((k, m)\)-deleted graphs
This page was built for publication: An isolated toughness condition for graphs to be fractional (\(k, m\))-deleted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604362)
