Path factorizations of complete multipartite graphs
From MaRDI portal
Publication:1296982
DOI10.1016/S0012-365X(98)00176-9zbMATH Open0930.05078WikidataQ114122931 ScholiaQ114122931MaRDI QIDQ1296982FDOQ1296982
Publication date: 9 February 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Resolvable path designs
- Existence of resolvable path designs
- \(G\)-designs and related designs
- On path factorizations of complete multipartite graphs
- \(P_{2p}\)-factorization of a complete bipartite graph
- P\({}_ 3\)-factorization of complete multipartite graphs
Cited In (9)
- Path-factors involving paths of order seven and nine
- P3-factorization of triangulated Cartesian product of complete graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Remarks on path factors in graphs
- Title not available (Why is that?)
- The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
- On path factorizations of complete multipartite graphs
- The spectrum of path factorization of bipartite multigraphs
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)