Mutual placement of bipartite graphs

DOI10.1016/0012-365X(93)90540-AzbMath0791.05080OpenAlexW2085371351MaRDI QIDQ1309454

Adam Paweł Wojda, Jean-Luc Fouquet

Publication date: 28 June 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90540-a

zbMATH Keywords

bipartite graph2-placementbiplacement

Mathematics Subject Classification ID

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

Related Items

Embedding graphs of small size, Packing bipartite graphs, Packing four copies of a tree into a complete bipartite graph, Packing three copies of a tree into a complete bipartite graph, Unnamed Item, Some results on placing bipartite graphs of maximum degree two

Cites Work

• Edge disjoint placement of graphs
• Packing trees in complete graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item