Minor-closed graph classes with bounded layered pathwidth
arXiv:1810.08314 · doi:10.1137/18M122162X
Abstract
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.