A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs

DOI10.1016/J.AML.2011.09.048zbMath1243.05204OpenAlexW2001736059MaRDI QIDQ427660

Si-zhong Zhou

Publication date: 14 June 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.09.048

zbMATH Keywords

neighborhood\(k\)-factorfractional \((k, m)\)-deleted graphfractional \(k\)-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

The existence of \(P_{\geq3}\)-factor covered graphs ⋮ Stability Number and k-Hamiltonian [a, b-factors] ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Neighborhood conditions and fractional \(k\)-factors
• A minimum degree condition of fractional \((k,m)\)-deleted graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Fan-type results for the existence of [\(a\),\(b\)-factors]
• A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS
• Some remarks about factors of graphs

This page was built for publication: A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs