An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor

  • Jittat Fakcharoenphol ,
  • Kunal Talwar

RANDOM-APPROX |

Published by Springer Verlag

Download BibTex

Given a graph G and a parameter **, we want to decompose the graph into clusters of diameter ** without cutting too many edges.