P₄k-1-factorization of bipartite multigraphs
From MaRDI portal
Publication:867765
DOI10.1007/S11425-006-0961-4zbMATH Open1109.05090OpenAlexW2150030039MaRDI QIDQ867765FDOQ867765
Authors: Jian Wang, Beiliang Du 
Publication date: 16 February 2007
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-006-0961-4
Recommendations
Cites Work
- Graph theory with applications
- \(P_ 3\)-factorization of complete bipartite graphs
- \(G\)-designs and related designs
- \(P_{4k-1}\)-factorization of complete bipartite graphs
- Title not available (Why is that?)
- The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
- \(P_{2p}\)-factorization of a complete bipartite graph
- Design of a new balanced file organization scheme with the least redundancy
- Title not available (Why is that?)
Cited In (8)
- On \(K_{p,q}\)-factorization of complete bipartite multigraphs
- Title not available (Why is that?)
- On \(z\)-cycle factorizations with two associate classes where \(z\) is even and \(a\) is \(0\) or \(1\,\mathrm{mod}\,z\)
- The spectrum of path factorization of bipartite multigraphs
- \(P_{4k-1}\)-factorization of complete bipartite graphs
- Existence of a trade-off factorization of a partially \(4\)-homogeneous graph
- On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs
- \(P_4\)-factorization of Cartesian product of complete graphs
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)
