On toughness and \((g,f)\)-factors in bipartite graphs
From MaRDI portal
Publication:861483
DOI10.1007/BF02832055zbMath1107.05070OpenAlexW1975401868MaRDI QIDQ861483
Publication date: 29 January 2007
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02832055
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (2)
More on monochromatic-rainbow Ramsey type theorems ⋮ Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
Cites Work
This page was built for publication: On toughness and \((g,f)\)-factors in bipartite graphs
