Packing two forests into a bipartite graph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199610)23:2<209::AID-JGT12>3.0.CO;2-B" /><209::AID-JGT12>3.0.CO;2-B 10.1002/(SICI)1097-0118(199610)23:2<209::AID-JGT12>3.0.CO;2-BzbMath0858.05089OpenAlexW4253671936MaRDI QIDQ4894624

Hong Wang

Publication date: 7 October 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199610)23:2<209::aid-jgt12>3.0.co;2-b

zbMATH Keywords

packingbipartite graphsbipartitionscompatible treesdisconnected forests

Mathematics Subject Classification ID

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

Related Items (7)

Packing four copies of a tree into a complete bipartite graph ⋮ Placing two edge-disjoint copies of a tree into a bipartite graph ⋮ Packing three copies of a tree into a complete bipartite graph ⋮ Unnamed Item ⋮ Packing trees in complete bipartite graphs ⋮ Unnamed Item ⋮ A near packing of two graphs

This page was built for publication: Packing two forests into a bipartite graph