Packing minor closed families of graphs

DOI10.1016/J.ENDM.2015.06.088zbMATH Open1346.05237OpenAlexW2180330891MaRDI QIDQ322346FDOQ322346

Authors: Silvia Messuti, Vojtěch Rödl, M. Schacht 

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.088

Recommendations

• Packing minor-closed families of graphs into complete graphs
• On packing minors into connected matroids
• Packings by cliques and by finite families of graphs
• scientific article; zbMATH DE number 1022391
• Packing spanning graphs from separable families
• Packings in complete graphs
• Packing graphs in their complements
• Near packings of graphs
• Packing and covering balls in graphs excluding a minor
• Densities of minor-closed graph families

zbMATH Keywords

graph packingminor closed familiesresolvable designs

Mathematics Subject Classification ID

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

Cites Work

• Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
• A Separator Theorem for Nonplanar Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Packing spanning graphs from separable families
• An approximate version of the tree packing conjecture
• Packing minor-closed families of graphs into complete graphs
• Tree decompositions of graphs without large bipartite holes
• Densities of minor-closed graph families
• On packing minors into connected matroids

This page was built for publication: Packing minor closed families of graphs

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