Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations

DOI10.1016/S0024-3795(02)00691-2zbMath1028.05061OpenAlexW2033739990MaRDI QIDQ1399253

Dominique de Werra

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

zbMATH Keywords

permutation matricesdoubly stochastic matricesequitable coloringsbalancing of cardinalities

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Stochastic matrices (15B51)

Related Items (2)

Equitable partitions into matchings and coverings in mixed graphs ⋮ Path colorings in bipartite graphs

Cites Work

• A note on SS/TDMA satellite communication
• Some applications of doubly stochastic matrices
• Restrictions and preassignments in preemptive open shop scheduling
• Time-slot assignment for TDMA-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations