\(\widehat S_k\)-factorization of symmetric complete tripartite digraphs
From MaRDI portal
Publication:1292882
zbMath0927.05066MaRDI QIDQ1292882
Publication date: 30 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items
Gregarious star factorization of the tensor product of graphs ⋮ Evenly partite star factorization of symmetric digraph of wreath product of graphs ⋮ Unnamed Item ⋮ Cycle-factorization of symmetric complete multipartite digraphs
Cites Work
- P\({}_ 3\)-factorization of complete multipartite graphs
- \(P_ 3\)-factorization of complete bipartite graphs
- \(C_ k\)-factorization of complete bipartite graphs
- On \(K_{1,k}\)-factorizations of a complete bipartite graph
- Complete bipartite factorisations by complete bipartite graphs
- Star-factorization of symmetric complete bipartite digraphs
- \(K_{1,p^2}\)-factorization of complete bipartite graphs
- \(G\)-designs and related designs
- Balanced bipartite graphs may be completely star-factored
- The Two-Triangle Case of the Acquaintance Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item