Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid

Ken-ichi Kawarabayashi, Yusuke Kobayashi. Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. In Christoph Dürr, Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. Volume 14 of LIPIcs, pages 278-289, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

Abstract

Abstract is missing.