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