On fractional (f,n)-critical graphs

DOI10.1016/J.IPL.2009.03.026zbMATH Open1197.05120OpenAlexW2159772608WikidataQ131581207 ScholiaQ131581207MaRDI QIDQ989490FDOQ989490

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

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.

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)

Cites Work

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

Cited In (10)

• Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs
• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• On fractional fragility rates of graph classes
• A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH
• Research on fractional critical covered graphs
• Title not available (Why is that?)
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• On toughness and fractional \((g,f,n)\)-critical graphs
• Title not available (Why is that?)
• NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS

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)