A toughness condition for the existence of f-factors in graphs

zbMATH Open1271.05077MaRDI QIDQ2839747FDOQ2839747

Authors: Jiansheng Cai 

Publication date: 12 July 2013

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1094191
• Binding numbers and \(f\)-factors of graphs
• scientific article; zbMATH DE number 1467781
• On toughness and \((g,f)\)-factors in bipartite graphs
• Isolated Toughness and Existence of f-Factors

zbMATH Keywords

spanning subgraph

Mathematics Subject Classification ID

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

Cited In (2)

• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• Strong Tutte type conditions and factors of graphs

This page was built for publication: A toughness condition for the existence of \(f\)-factors in graphs

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