The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs

DOI10.1007/S11425-006-0289-0zbMath1107.05073OpenAlexW2164789733WikidataQ123286198 ScholiaQ123286198MaRDI QIDQ862676

Beiliang Du, Jian Wang

Publication date: 24 January 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-0289-0

zbMATH Keywords

complete bipartite graphfactorizationUshio conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

\(P_{4k-1}\)-factorization of bipartite multigraphs ⋮ Path-factorizations of complete bipartite multigraphs ⋮ On \(K_{p,q}\)-factorization of complete bipartite multigraphs ⋮ The spectrum of path factorization of bipartite multigraphs ⋮ P₃-factorization of triangulated Cartesian product of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(P_{2p}\)-factorization of a complete bipartite graph
• \(P_ 3\)-factorization of complete bipartite graphs
• Complete bipartite factorisations by complete bipartite graphs
• \(K_{1,p^2}\)-factorization of complete bipartite graphs
• \(G\)-designs and related designs
• \(K_{1,k}\)-factorization of complete bipartite graphs
• \(K_{p,q}\)-factorization of complete bipartite graphs
• \(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: The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs