Toughness and existence of fractional (g,f)-factors in graphs

MaRDI QIDQ3011817zbMATH OpenFDO

Authors Shuli Liu, Jiansheng Cai

Publication date 29 June 2011

zbMATH Keywords

graphtoughnessfractional \((g,f)\)-factor

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5844238
• On toughness and fractional \((g,f,n)\)-critical graphs
• Isolated toughness and fractional \((g,f)\)-factors of graphs.
• Tight toughness condition for fractional \((g,f,n)\)-critical graphs
• Isolated toughness and fractional \((g,f)\)-factors of graphs

Cited in

(6)

• Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
• Toughness and the existence of fractional k-factors of graphs
• scientific article; zbMATH DE number 2164703 (Why is no real title available?)
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• On toughness and \((g,f)\)-factors in bipartite graphs
• On toughness and fractional \((g,f,n)\)-critical graphs

This page was built for publication: Toughness and existence of fractional \((g,f)\)-factors in graphs

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