A note on packing two copies of a tree into a graph with small maximum degree

DOI10.1016/J.DISC.2020.111991zbMath1445.05083OpenAlexW3033458609MaRDI QIDQ785787

Mariusz Woźniak, Agnieszka Goerlich

Publication date: 12 August 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111991

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (1)

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

Cites Work

• Unnamed Item
• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• Packing of graphs and permutations -- a survey
• Packing of graphs - a survey
• Packing two copies of a sparse graph into a graph with restrained maximum degree
• Every (p,p-2) graph is contained in its complement

This page was built for publication: A note on packing two copies of a tree into a graph with small maximum degree