\(P_{4k-1}\)-factorization of bipartite multigraphs
type: Item
instance of: scholarly article
title: \(P_{4k-1}\)-factorization of bipartite multigraphs
zbMATH Open document ID: 1109.05090
author: Jian Wang
author: Beiliang Du
published in: Science in China. Series A
publication date: 2007-02-16T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5127928
zbMATH Keywords: factor
MaRDI profile type: Publication
full work available at URL: s11425-006-0961-4
OpenAlex ID: W2150030039
cites work: \(G\)-designs and related designs
cites work: Q3097395
cites work: Design of a new balanced file organization scheme with the least redundancy
cites work: \(P_{2p}\)-factorization of a complete bipartite graph
cites work: Q4488570
cites work: \(P_ 3\)-factorization of complete bipartite graphs
cites work: Q4443257
cites work: \(P_{4k-1}\)-factorization of complete bipartite graphs
cites work: The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
DOI: 10.1007/S11425-006-0961-4
description: scientific article; zbMATH DE number 5127928