Cycle-factorization of symmetric complete multipartite digraphs

DOI10.1016/S0012-365X(98)00302-1zbMath0930.05070MaRDI QIDQ1297459

Kazuhiko Ushio

Publication date: 30 January 2000

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

zbMATH Keywords

cyclefactorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ On resolvable multipartite \(G\)-designs. II ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• P\({}_ 3\)-factorization of complete multipartite graphs
• \(P_ 3\)-factorization of complete bipartite graphs
• \(C_ k\)-factorization of complete bipartite graphs
• \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs
• On \(K_{1,k}\)-factorizations of a complete bipartite graph
• Parallel concepts in graph theory
• Complete bipartite factorisations by complete bipartite graphs
• Star-factorization of symmetric complete bipartite digraphs
• \(G\)-designs and related designs
• Balanced bipartite graphs may be completely star-factored

This page was built for publication: Cycle-factorization of symmetric complete multipartite digraphs