NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS

DOI10.1017/S0004972709000963zbMath1203.05129MaRDI QIDQ3564912

Bing-Yuan Pu, Si-zhong Zhou, Yang Xu

Publication date: 26 May 2010

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

graphfractional \(k\)-factorneighbourhood

Mathematics Subject Classification ID

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

Related Items

A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]

Cites Work

• Unnamed Item
• On fractional \((f,n)\)-critical graphs
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Fan-type results for the existence of [\(a\),\(b\)-factors]
• The dynamics of a prey-dependent consumption model concerning integrated pest management
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
• k -Factors and Neighbourhoods of Independent Sets in Graphs

This page was built for publication: NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS