\(\widehat C_k\)-factorization of symmetric complete bipartite and tripartite multi-digraphs

DOI10.1016/S0012-365X(00)00104-7zbMath0967.05052OpenAlexW2123845709MaRDI QIDQ1587625

Yoshikazu Ohtsubo, Kazuhiko Ushio

Publication date: 14 January 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00104-7

zbMATH Keywords

cycle-factorizationsymmetric complete bipartite multi-digraphtripartite multi-digraph

Mathematics Subject Classification ID

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

Related Items (3)

Large sets of Hamilton cycle and path decompositions of complete bipartite graphs ⋮ On resolvable multipartite \(G\)-designs. II ⋮ Unnamed Item

This page was built for publication: \(\widehat C_k\)-factorization of symmetric complete bipartite and tripartite multi-digraphs