Packing minor closed families of graphs

DOI10.1016/J.ENDM.2015.06.088zbMath1346.05237OpenAlexW2180330891MaRDI QIDQ322346

Mathias Schacht, Silvia Messuti, Vojtěch Rödl

Publication date: 14 October 2016

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

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)

Related Items (1)

An approximate version of the tree packing conjecture

Cites Work

• Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
• A Separator Theorem for Nonplanar Graphs
• Unnamed Item
• Unnamed Item

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