A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS

DOI10.1017/S0017089509990139zbMath1260.05124OpenAlexW2047509093MaRDI QIDQ3655768

Si-zhong Zhou

Publication date: 12 January 2010

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0017089509990139

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (6)

A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs ⋮ A toughness condition for fractional \((k, m)\)-deleted graphs revisited ⋮ An independent set degree condition for fractional critical deleted graphs ⋮ BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS

Cites Work

• Unnamed Item
• Toughness and the existence of fractional \(k\)-factors of graphs
• Some sufficient conditions for graphs to have (g, f)-factors
• Some remarks about factors of graphs

This page was built for publication: A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS