Robust Contraction Decomposition for Minor-Free Graphs and its Applications

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +6

We prove a robust contraction decomposition theorem for $H$-minor-free graphs, which states that given an $H$-minor-free graph $G$ and an integer $p$, one can partition in polynomi…