Packing of graphs with small product of sizes

DOI10.1016/j.jctb.2008.02.004zbMath1204.05078OpenAlexW2126113695MaRDI QIDQ958696

Gexin Yu, Alexandr V. Kostochka

Publication date: 8 December 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.02.004

zbMATH Keywords

graph packing

Mathematics Subject Classification ID

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

Related Items (1)

On a packing problem of Alon and Yuster

Cites Work

• Edge disjoint placement of graphs
• Packing two graphs of order n having total size at most 2n-2
• Packings of graphs and applications to computational complexity
• An extremal result for subgraphs with few edges
• Packing \(d\)-degenerate graphs
• On the Erdös-Stone Theorem
• On the Structure of Edge Graphs II
• On Two Conjectures on Packing of Graphs
• On the structure of linear graphs

This page was built for publication: Packing of graphs with small product of sizes