\(f\)-factors in bipartite (\(mf\))-graphs

DOI10.1016/S0166-218X(03)00197-5zbMath1032.05107OpenAlexW2091342035MaRDI QIDQ1421483

Wenan Zang, Gui Zhen Liu

Publication date: 26 January 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00197-5

zbMATH Keywords

ConnectivityEdge-connectivityBipartite graph\(f\)-Factor

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficient conditions for a graph to have factors
• Perfect matchings in regular bipartite graphs
• Factors and factorizations of graphs—a survey
• Regular factors of regular graphs

This page was built for publication: \(f\)-factors in bipartite (\(mf\))-graphs