Path-factorizations of complete bipartite multigraphs

DOI10.1016/J.DISC.2012.03.010zbMath1243.05202OpenAlexW2059126233WikidataQ114190754 ScholiaQ114190754MaRDI QIDQ427853

Nigel Martin

Publication date: 18 June 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.010

zbMATH Keywords

multigraphcomplete bipartite graphfactorization

Mathematics Subject Classification ID

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

Cites Work

• The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
• \(G\)-designs and related designs
• \(P_{4k-1}\)-factorization of complete bipartite graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Path-factorizations of complete bipartite multigraphs