Packing smaller graphs into a graph

DOI10.1016/0012-365X(89)90072-1zbMATH Open0678.05046OpenAlexW2094837750MaRDI QIDQ1123906FDOQ1123906

Authors: Jin Akiyama, Fumi Nakada, Sinichi Tokunaga 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90072-1

Recommendations

• scientific article; zbMATH DE number 1022391
• Graph packings
• Packing of graphs with small product of sizes
• Packing parameters in graphs
• Packing and Squeezing Subgraphs into Planar Graphs
• Packing in regular graphs
• Packing graphs in their complements
• Packing of graphs - a survey
• scientific article; zbMATH DE number 786556
• Efficient subgraphs packing

zbMATH Keywords

m-packing number

Mathematics Subject Classification ID

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

Cited In (2)

• How to Pack Directed Acyclic Graphs into Small Blocks
• Packing constants in graphs and connectivity

This page was built for publication: Packing smaller graphs into a graph

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