Minor-closed graph classes with bounded layered pathwidth

10/19/2018

∙

by   Vida Dujmovic, et al.

∙

0

∙

share

We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded pathwidth if and only if some forest is not in the class.