Cycle-factorization of symmetric complete multipartite digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 19219 (Why is no real title available?)
- Balanced bipartite graphs may be completely star-factored
- Complete bipartite factorisations by complete bipartite graphs
- On \(K_{1,k}\)-factorizations of a complete bipartite graph
- P\({}_ 3\)-factorization of complete multipartite graphs
- Parallel concepts in graph theory
- Star-factorization of symmetric complete bipartite digraphs
- \(C_ k\)-factorization of complete bipartite graphs
- \(G\)-designs and related designs
- \(P_ 3\)-factorization of complete bipartite graphs
- S_k-factorization of symmetric complete tripartite digraphs
Cited in
(11)- On resolvable multipartite \(G\)-designs. II
- scientific article; zbMATH DE number 19219 (Why is no real title available?)
- scientific article; zbMATH DE number 1293948 (Why is no real title available?)
- On resolvable multipartite G-designs
- scientific article; zbMATH DE number 2230316 (Why is no real title available?)
- The path-cycle symmetric function of a digraph
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
- \(\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
- scientific article; zbMATH DE number 6928815 (Why is no real title available?)
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)
