Packing two forests into a bipartite graph

DOI10.1002/(SICI)1097-0118(199610)23:2%3C209::AID-JGT12%3E3.0.CO;2-BMaRDI QIDQ4894624zbMATH OpenOpenAlexFDO

Authors Hong Wang

Publication date 7 October 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199610)23:2%3C209::aid-jgt12%3E3.0.co;2-b

zbMATH Keywords

bipartite graphsbipartitionscompatible treesdisconnected forestspacking

Mathematics Subject Classification ID

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

Recommendations

• Packing two bipartite graphs into a complete bipartite graph
• On packing trees into complete bipartite graphs
• scientific article; zbMATH DE number 731858

Cited in

(14)

• On self-complementary cyclic packing of forests
• On packing bipartite graphs
• A note on packing of three forests
• A near packing of two graphs
• Packing trees in complete bipartite graphs
• Increasing forests and quadrangulations via a bijective approach
• Packing two bipartite graphs into a complete bipartite graph
• Bipacking a bipartite graph with girth at least 12
• Packing four copies of a tree into a complete bipartite graph
• Packing trees into complete \(k\)-partite graph
• Placing two edge-disjoint copies of a tree into a bipartite graph
• Packing three copies of a tree into a complete bipartite graph
• Proof of a packing conjecture of bipartite graphs
• Packing two copies of a tree into a bipartite graph with restrained maximum degree

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

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