On fractional (f,n)-critical graphs

DOI10.1016/J.IPL.2009.03.026MaRDI QIDQ989490zbMATHOpenAlexWikidataFDO

Authors Qiqing Shen, Sizhong 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)

Recommendations

• A remark about fractional \((f,n)\)-critical graphs
• Binding numbers and fractional \((g,f,n)\)-critical graphs
• A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph
• scientific article; zbMATH DE number 6391577
• On fractional \((g,f,n)\)-critical graphs.

Cites work

• scientific article; zbMATH DE number 5138378 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 7492071 (Why is no real title available?)
• scientific article; zbMATH DE number 5221493 (Why is no real title available?)
• scientific article; zbMATH DE number 2192197 (Why is no real title available?)
• A degree condition for the existence ofk-factors
• An algorithmic proof of Tutte's f-factor theorem
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Complete-factors and \((g,f)\)-covered graphs
• Fractional \((g,f)\)-factors of graphs
• Graph theory
• Neighborhood conditions and \(k\)-factors
• Some sufficient conditions for graphs to have (g, f)-factors
• The binding number of a graph and its Anderson number
• The binding numbers of graphs and fractional \(n\)-edge (vertex) deleted graphs

Cited in

(15)

• scientific article; zbMATH DE number 6116733 (Why is no real title available?)
• Binding numbers for all fractional \((a,b,k)\)-critical graphs
• Research on fractional critical covered graphs
• On fractional fragility rates of graph classes
• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• A remark about fractional \((f,n)\)-critical graphs
• Binding numbers and fractional \((g,f,n)\)-critical graphs
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Neighbourhood and the existence of fractional \(k\)-factors of graphs
• A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph
• An existence theorem on fractional \((g, f, n)\)-critical graphs
• On fractional \((g,f,n)\)-critical graphs.
• Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs
• On toughness and fractional \((g,f,n)\)-critical graphs
• scientific article; zbMATH DE number 7446517 (Why is no real title available?)

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

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