Packing two bipartite graphs into a complete bipartite graph
From MaRDI portal
Publication:4362090
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199710)26:2<95::AID-JGT4>3.0.CO;2-A" /><95::AID-JGT4>3.0.CO;2-A 10.1002/(SICI)1097-0118(199710)26:2<95::AID-JGT4>3.0.CO;2-AzbMath0883.05111OpenAlexW4253608841MaRDI QIDQ4362090
Publication date: 23 February 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199710)26:2<95::aid-jgt4>3.0.co;2-a
Related Items (3)
Placing two edge-disjoint copies of a tree into a bipartite graph ⋮ Unnamed Item ⋮ On the bipartite graph packing problem
This page was built for publication: Packing two bipartite graphs into a complete bipartite graph
