\((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs

DOI10.1007/S11766-004-0046-5zbMath1060.05078OpenAlexW2071635054MaRDI QIDQ1764381

Qiuju Bian, Gui Zhen Liu

Publication date: 24 February 2005

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-004-0046-5

zbMATH Keywords

bipartite graphconnectivity\((g,f)\)-factor

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• \(f\)-factors in bipartite (\(mf\))-graphs
• Some problems on factorizations with constraints in bipartite graphs
• Perfect matchings in regular bipartite graphs
• Factors and factorizations of graphs—a survey
• Regular factors of regular graphs
• Orthogonal \((g,f)\)-factorizations of bipartite graphs

This page was built for publication: \((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs