Low Polynomial Exclusion of Planar Graph PatternsReportar como inadecuado

Low Polynomial Exclusion of Planar Graph Patterns - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 ALGCO - Algorithmes, Graphes et Combinatoire LIRMM - Laboratoire d-Informatique de Robotique et de Microélectronique de Montpellier 2 MPLA - Department of Mathematics

Abstract : The celebrated grid exclusion theorem states that for every h-vertex planar graph H, there is a constant ch such that if a graph G does not contain H as a minor then G has treewidth at most ch. We are looking for patterns of H where this bound can become a low degree polynomial. We provide such bounds for the following parameterized graphs: the wheel ch=Oh, the double wheel ch=Oh2⋅log2h, any graph of pathwidth at most 2 ch=Oh2, and the yurt graph ch=Oh4.

Keywords : graph minors treewidth

Autor: Jean-Florent Raymond - Dimitrios M. Thilikos -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados