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

DOI10.1016/S0024-3795(02)00691-2MaRDI QIDQ1399253zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Path colorings in bipartite graphs
• On the complexity of some edge-partition problems for graphs
• Decomposition of bipartite graphs under degree constraints
• On partitioning two matroids into common independent subsets
• scientific article; zbMATH DE number 4148138

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3491001 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• A note on SS/TDMA satellite communication
• Restrictions and preassignments in preemptive open shop scheduling
• Some applications of doubly stochastic matrices
• Time-slot assignment for TDMA-systems
• Variations on the theorem of Birkhoff-von Neumann and extensions

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399253)