Orthogonal \((g,f)\)-factorizations of bipartite graphs

DOI10.1016/S0252-9602(17)30417-4zbMath0989.05096OpenAlexW2783788187WikidataQ114121518 ScholiaQ114121518MaRDI QIDQ5959676

Henian Dong, Gui Zhen Liu

Publication date: 20 March 2002

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(17)30417-4

zbMATH Keywords

bipartite graph\((g,f)\)-factor\((g,f)\)-factorizationorthogonal factorization

Mathematics Subject Classification ID

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

Related Items (3)

Randomly orthogonal factorizations with constraints in bipartite networks ⋮ \((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs ⋮ Orthogonal factorizations of digraphs

This page was built for publication: Orthogonal \((g,f)\)-factorizations of bipartite graphs