Packing two trees into a graph with restrained maximum degree

DOI10.1016/J.DAM.2025.11.028MaRDI QIDQ6866671zbMATH OpenFDO

Authors Hui Li, Ning Wang, Yunshu Gao

Publication date 28 January 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.11.028

zbMATH Keywords

embeddingnon-star treepacking

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A generalization of the graph packing theorems of Sauer-Spencer and Brandt
• A note on packing two copies of a tree into a graph with small maximum degree
• Edge disjoint placement of graphs
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• Mutual placement of bipartite graphs
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• Packing two copies of a sparse graph into a graph with restrained maximum degree
• Packing two copies of a tree into a bipartite graph with restrained maximum degree
• Packings of graphs and applications to computational complexity
• Placing two edge-disjoint copies of a tree into a bipartite graph
• Subgraphs of graphs. I
• Toward Żak's conjecture on graph packing

This page was built for publication: Packing two trees into a graph with restrained maximum degree

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