Path factorizations of complete multipartite graphs
From MaRDI portal
Publication:1296982
Recommendations
Cites work
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 3592042 (Why is no real title available?)
- Existence of resolvable path designs
- Graph theory
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- On path factorizations of complete multipartite graphs
- P\({}_ 3\)-factorization of complete multipartite graphs
- Resolvable path designs
- \(G\)-designs and related designs
- \(P_{2p}\)-factorization of a complete bipartite graph
Cited in
(10)- Path-factors involving paths of order seven and nine
- The spectrum of path factorization of bipartite multigraphs
- P3-factorization of triangulated Cartesian product of complete graphs
- \(\tilde{S}_k\)-factorization of the symmetric digraph of wreath product of graphs
- The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
- On path factorizations of complete multipartite graphs
- scientific article; zbMATH DE number 4150220 (Why is no real title available?)
- scientific article; zbMATH DE number 5237268 (Why is no real title available?)
- scientific article; zbMATH DE number 5823698 (Why is no real title available?)
- Remarks on path factors in graphs
This page was built for publication: Path factorizations of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296982)