Neighbourhood and the existence of fractional k-factors of graphs

DOI10.1017/S0004972709000963zbMATH Open1203.05129MaRDI QIDQ3564912FDOQ3564912

Authors: Bing-Yuan Pu, Sizhong Zhou, Yang Xu 

Publication date: 26 May 2010

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

Recommendations

• Some new sufficient conditions for graphs to have fractional \(k\)-factors
• Neighborhood conditions for the existence of fractional \(k\)-factors with prescribed properties
• A result on the existence of fractional \(k\)-factors in graphs
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• Some results on fractional \(k\)-factors

zbMATH Keywords

graphfractional \(k\)-factorneighbourhood

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• A result on fractional \((a,b,k)\)-critical covered graphs
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
• Some new sufficient conditions for graphs to have fractional \(k\)-factors
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• Neighborhood conditions for the existence of fractional \(k\)-factors with prescribed properties
• A result on the existence of fractional \(k\)-factors in graphs
• Neighborhood union and connected \([k,k+1]\)-factors in graphs

This page was built for publication: Neighbourhood and the existence of fractional \(k\)-factors of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564912)