Cycle-factorization of symmetric complete multipartite digraphs
From MaRDI portal
Publication:1297459
DOI10.1016/S0012-365X(98)00302-1zbMATH Open0930.05070MaRDI QIDQ1297459FDOQ1297459
Authors: Kazuhiko Ushio 
Publication date: 30 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Parallel concepts in graph theory
- Title not available (Why is that?)
- \(P_ 3\)-factorization of complete bipartite graphs
- \(G\)-designs and related designs
- Star-factorization of symmetric complete bipartite digraphs
- \(C_ k\)-factorization of complete bipartite graphs
- On \(K_{1,k}\)-factorizations of a complete bipartite graph
- Complete bipartite factorisations by complete bipartite graphs
- P\({}_ 3\)-factorization of complete multipartite graphs
- Balanced bipartite graphs may be completely star-factored
- Title not available (Why is that?)
- \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs
Cited In (11)
- 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?)
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
- The path-cycle symmetric function of a digraph
- \(\hat S_k\)-factorization of complete multipartite symmetric digraphs
- Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
- Symmetric factorizations of the complete uniform hypergraph
- Title not available (Why is that?)
This page was built for publication: Cycle-factorization of symmetric complete multipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297459)
