Packing bipartite graphs

DOI10.1016/S0012-365X(96)00065-9zbMath0872.05046OpenAlexW2017002372MaRDI QIDQ1356720

Paul Vaderlind, Adam Paweł Wojda

Publication date: 10 June 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00065-9

zbMATH Keywords

packingbipartite graphs

Mathematics Subject Classification ID

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

Related Items (2)

Some results on placing bipartite graphs of maximum degree two ⋮ On the bipartite graph packing problem

Cites Work

• Unnamed Item
• Advances in graph theory
• Mutual placement of bipartite graphs
• Transversal theory. An account of some aspects of combinatorial mathematics
• Subgraphs of graphs. I
• A Theorem on General Measure Functions

This page was built for publication: Packing bipartite graphs