• Citer

Minor-closed graph classes with bounded layered pathwidth

par Dujmović, Vida V.;Eppstein, David;Joret, Gwenaël ;Morin, Pat;Wood, David
Référence SIAM journal on discrete mathematics, 34, 3, page (1693-1709)
Publication Publié, 2020-12-01

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

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 generalizes 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.