C_k-factorization of symmetric complete bipartite and tripartite multi-digraphs

DOI10.1016/S0012-365X(00)00104-7MaRDI QIDQ1587625zbMATH OpenOpenAlexFDO

Authors Kazuhiko Ushio, Yoshikazu Ohtsubo

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)

Recommendations

• scientific article; zbMATH DE number 1355296
• S_k-factorization of symmetric complete tripartite digraphs
• \(\vec {P}_{2k+1}\)-factorization of symmetric complete bipartite multi-digraphs.
• scientific article; zbMATH DE number 2024686
• \(\widehat K_{p,q}\)-factorization of symmetric complete tripartite digraphs

Cited in

(9)

• On resolvable multipartite \(G\)-designs. II
• scientific article; zbMATH DE number 1293948 (Why is no real title available?)
• scientific article; zbMATH DE number 2230316 (Why is no real title available?)
• Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
• \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs
• \(\vec P_5\)-factorization of symmetric complete bipartite multi-digraphs
• On resolvable multipartite \(G\)-designs
• \(\hat S_k\)-factorization of complete multipartite symmetric digraphs
• scientific article; zbMATH DE number 2024686 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587625)