A minimum degree condition of fractional \((k,m)\)-deleted graphs

DOI10.1016/j.crma.2009.09.022zbMath1223.05032OpenAlexW2005295277MaRDI QIDQ1040547

Si-zhong Zhou

Publication date: 25 November 2009

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2009.09.022

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (8)

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS] ⋮ A sufficient condition for the existence of a k-factor excluding a given r-factor ⋮ A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ Some new sufficient conditions for graphs to have fractionalk-factors ⋮ Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs ⋮ A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs ⋮ An independent set degree condition for fractional critical deleted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum degree of a graph and the existence of k-factors
• Toughness and the existence of fractional \(k\)-factors of graphs
• Fractional \((g,f)\)-factors of graphs

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