Decomposition of bipartite multigraphs into matchings

DOI10.1007/BF01963619zbMath0234.05116MaRDI QIDQ5642584

Dominique de Werra

Publication date: 1972

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (5)

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs ⋮ Some results in chromatic scheduling ⋮ Kőnig's edge-colouring theorem for all graphs ⋮ Optimal partition of a bipartite graph into non-crossing matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of bipartite multigraphs into matchings