On fractional \((f,n)\)-critical graphs

DOI10.1016/J.IPL.2009.03.026zbMath1197.05120OpenAlexW2159772608WikidataQ131581207 ScholiaQ131581207MaRDI QIDQ989490

Qiqing Shen, Si-zhong Zhou

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.026

zbMATH Keywords

graphcombinatorial problemsbinding numberfractional \(f\)-factorfractional \((f, n)\)-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ On toughness and fractional \((g,f,n)\)-critical graphs ⋮ A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH ⋮ NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS ⋮ A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs

Cites Work

• Neighborhood conditions and \(k\)-factors
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• A degree condition for the existence ofk-factors
• An algorithmic proof of Tutte's f-factor theorem
• Some sufficient conditions for graphs to have (g, f)-factors
• The binding number of a graph and its Anderson number
• Fractional \((g,f)\)-factors of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On fractional \((f,n)\)-critical graphs