P₄k-1-factorization of bipartite multigraphs
From MaRDI portal
Publication:867765
Recommendations
Cites work
- scientific article; zbMATH DE number 2024686 (Why is no real title available?)
- scientific article; zbMATH DE number 1471075 (Why is no real title available?)
- Design of a new balanced file organization scheme with the least redundancy
- Graph theory with applications
- The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
- \(G\)-designs and related designs
- \(P_ 3\)-factorization of complete bipartite graphs
- \(P_{2p}\)-factorization of a complete bipartite graph
- \(P_{4k-1}\)-factorization of complete bipartite graphs
Cited in
(8)- The spectrum of path factorization of bipartite multigraphs
- On \(z\)-cycle factorizations with two associate classes where \(z\) is even and \(a\) is \(0\) or \(1\,\mathrm{mod}\,z\)
- On \(K_{p,q}\)-factorization of complete bipartite multigraphs
- \(P_4\)-factorization of Cartesian product of complete graphs
- \(P_{4k-1}\)-factorization of complete bipartite graphs
- scientific article; zbMATH DE number 1471075 (Why is no real title available?)
- On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs
- Existence of a trade-off factorization of a partially \(4\)-homogeneous graph
This page was built for publication: \(P_{4k-1}\)-factorization of bipartite multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867765)
