\(P_{4k-1}\)-factorization of bipartite multigraphs
From MaRDI portal
Publication:867765
DOI10.1007/S11425-006-0961-4zbMath1109.05090OpenAlexW2150030039MaRDI QIDQ867765
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
Related Items (2)
On \(K_{p,q}\)-factorization of complete bipartite multigraphs ⋮ The spectrum of path factorization of bipartite multigraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(P_{2p}\)-factorization of a complete bipartite graph
- The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
- \(P_ 3\)-factorization of complete bipartite graphs
- \(G\)-designs and related designs
- \(P_{4k-1}\)-factorization of complete bipartite graphs
- Design of a new balanced file organization scheme with the least redundancy
This page was built for publication: \(P_{4k-1}\)-factorization of bipartite multigraphs
