C_k-factorization of symmetric complete bipartite and tripartite multi-digraphs
From MaRDI portal
Publication:1587625
DOI10.1016/S0012-365X(00)00104-7zbMATH Open0967.05052OpenAlexW2123845709MaRDI QIDQ1587625FDOQ1587625
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
Recommendations
- scientific article; zbMATH DE number 1355296
- \(\widehat 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- On resolvable multipartite \(G\)-designs
- Title not available (Why is that?)
- \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs
- \(\hat S_k\)-factorization of complete multipartite symmetric digraphs
- Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
- \(\vec P_5\)-factorization of symmetric complete bipartite multi-digraphs
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)
