Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
From MaRDI portal
Publication:1399253
DOI10.1016/S0024-3795(02)00691-2zbMath1028.05061OpenAlexW2033739990MaRDI QIDQ1399253
Publication date: 30 July 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(02)00691-2
Related Items (2)
Equitable partitions into matchings and coverings in mixed graphs ⋮ Path colorings in bipartite graphs
Cites Work
This page was built for publication: Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations