Minor-closed graph classes with bounded layered pathwidth
Combinatorics
2020-08-03 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1810.08314,
title = {Minor-closed graph classes with bounded layered pathwidth},
author = {Vida Dujmović and David Eppstein and Gwenaël Joret and Pat Morin and David R. Wood},
journal= {arXiv preprint arXiv:1810.08314},
year = {2020}
}