A toughness condition for the existence of \(f\)-factors in graphs
From MaRDI portal
Publication:2839747
zbMATH Open1271.05077MaRDI QIDQ2839747
Publication date: 12 July 2013
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Could not fetch data.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)
Related Items (2)
Strong Tutte type conditions and factors of graphs ⋮ Toughness and the existence of Hamiltonian \([a, b\)-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)
