Placing two edge-disjoint copies of a tree into a bipartite graph

DOI10.1016/j.amc.2023.128045OpenAlexW4367326975MaRDI QIDQ6105991

No author found.

Publication date: 27 June 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2023.128045

zbMATH Keywords

embeddingtree decomposition2-packing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Packing three copies of a tree into a complete bipartite graph
• A note on packing two copies of a tree into a graph with small maximum degree
• Packings of graphs and applications to computational complexity
• Packing of graphs and permutations -- a survey
• Packing of graphs - a survey
• Packing a number of copies of a \(( p , q )\)-graph
• Packing large trees of consecutive orders
• Packing two copies of a sparse graph into a graph with restrained maximum degree
• Packing two bipartite graphs into a complete bipartite graph
• Packing two forests into a bipartite graph
• On the Tree Packing Conjecture

This page was built for publication: Placing two edge-disjoint copies of a tree into a bipartite graph